LeetCode 665. Non-decreasing Array

题目

代码

class Solution:
    def checkPossibility(self, nums):
        """
        :type nums: List[int]
        :rtype: bool
        """
        count = 0
        for i in range(len(nums)):
            if i < len(nums) - 1:
                if nums[i] > nums[i + 1]:
                    count += 1
                    if i != 0:
                        if nums[i + 1] < nums[i - 1]:
                            nums[i + 1] = nums[i]
                    else:
                        nums[i] = nums[i + 1]
        return count <= 1