da299b54创建于 2023年4月1日历史提交
class Solution:
    def checkPossibility(self, nums):
        if len(nums) <= 2:
            return True
        changed = False
        for i, num in enumerate(nums):
            if i == len(nums) - 1 or num <= nums[i + 1]:
                continue
            if changed:
                return False
            if i == 0 or nums[i + 1] >= nums[i - 1]:
                nums[i] = nums[i + 1]
            else:
                nums[i + 1] = nums[i]
            changed = True
        return True