LeetCode : 665. Non-decreasing Array 修改一个位置使得数组非递减

最新推荐文章于 2023-01-20 09:44:17 发布

青盏

最新推荐文章于 2023-01-20 09:44:17 发布

阅读量353

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_16234613/article/details/89644351

版权

LeetCode 专栏收录该内容

154 篇文章 1 订阅

订阅专栏

试题
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) {
        int cnt = 0;
        for(int i=0; i<nums.length-1 && cnt<2; i++){
            
            if(nums[i]<=nums[i+1]) continue;
            cnt++;
            
            if( (i-1>=0 && nums[i-1]<=nums[i+1]) || i==0){
                continue;
            }else if( (i+2<nums.length && nums[i+2]>=nums[i]) || i==nums.length-2 ){
                continue;
            }else{
                return false;
            }
        }
        
        if(cnt>1) return false;
        else return true;
    }
}