00665-NonDecreasingArray.py

# https://leetcode.com/problems/non-decreasing-array/description/

class Solution:
    def checkPossibility(self, nums: List[int]) -> bool:
        """
        Logic: Brute Force

        Time: O(n)
        Space: O(1)
        """
        count = 0

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