<doocs>0665.Non-decreasing Array_1.py
def checkPossibility( nums):
    if len(nums) < 2:
        return True
    count = 0
    for i in range(1, len(nums)):
        if nums[i] < nums[i - 1]:
            if count == 1:
                return False
            if not (
                i + 1 == len(nums)
                or nums[i + 1] >= nums[i - 1]
                or i - 2 < 0
                or nums[i - 2] < nums[i]
            ):
                return False
            else:
                count = 1
    return True
def sample_funcname ( var_0 ) :
    if len ( var_0 ) < 2 :
        return True
    var_5 = 0
    for var_8 in range ( 1 , len ( var_0 ) ) :
        if var_0 [ var_8 ] < var_0 [ var_8 - 1 ] :
            if var_5 == 1 :
                return False
            if not ( var_8 + 1 == len ( var_0 ) or var_0 [ var_8 + 1 ] >= var_0 [ var_8 - 1 ] or var_8 - 2 < 0 or var_0 [ var_8 - 2 ] < var_0 [ var_8 ] ) :
                return False
            else :
                var_5 = 1
    return True
