1099. 不下降数组

class Solution:
    """
    @param nums: an array
    @return: if it could become non-decreasing by modifying at most 1 element
    """
    def checkPossibility(self,nums):
        if len(nums) == 1:
            return True
        for i in range(len(nums)-1):
            if nums[i+1] < nums[i]:
                break

        nums.pop(i)
        if nums == sorted(nums):
            return True
        return False