human
Solve in Python:
Given an array with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element.


We define an array is non-decreasing if array[i]  holds for every i (1 

Example 1:

Input: [4,2,3]
Output: True
Explanation: You could modify the first 4 to 1 to get a non-decreasing array.


Example 2:

Input: [4,2,1]
Output: False
Explanation: You can't get a non-decreasing array by modify at most one element.


Note:
The n belongs to [1, 10,000].

=====
Give me a the Python code you requested?
assistant
#Here is the Python code you requested.

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