LeetCode 665. Non-decreasing Array

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] <= array[i + 1] holds for every i (1 <= i < n).

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].

class Solution {
    
    public boolean checkPossibility(int[] nums) {
        for(int i = 1;i<nums.length;i++){
            if(nums[i]<nums[i-1]){
                if(i-2>=0 && nums[i]<nums[i-2]){//第三个比前两个都小
                    nums[i] = nums[i-1];//只能增大第三个，否则要同时改动前两个
                }
                else{
                    nums[i-1] = nums[i];//优先减小前一个（如果改动第二个，可能还会影响后面的）
                }
            }
        }
    }
}