Non-decreasing Array LeetCode solution in Python

1
class Solution:
2
    def checkPossibility(self, nums: List[int]) -> bool:
3
        unstable = 0
4
        for i in range(1, len(nums)):
5
            if nums[i] < nums[i - 1]:
6
                unstable += 1
7
                if i < 2 or nums[i - 2] <= nums[i]:
8
                    nums[i - 1] = nums[i]
9
                else:
10
                    nums[i] = nums[i - 1]
11

12
                if unstable > 1:
13
                    return False
14
        return True