Non-decreasing Array Solutions in Python

Number 665

Difficulty Easy

Acceptance 19.5%

Other languages —

Solutions

Python solution by haoel/leetcode

def checkPossibility(self, nums):
    count = 0
    for i in range(1, len(nums)):
        if nums[i] < nums[i - 1]:
            count += 1
            if i == 1 or nums[i - 2] <= nums[i]: nums[i - 1] = nums[i]
            else: nums[i] = nums[i - 1]
        
        if count >= 2: return False
    return True

def checkPossibility(self, nums):
    count = 0
    for i in range(1, len(nums)):
        if nums[i] < nums[i - 1]:
            count += 1
            if i == 1 or nums[i - 2] <= nums[i]: nums[i - 1] = nums[i]
            else: nums[i] = nums[i - 1]
        
        if count >= 2: return False
    return True