【刷leetcode，拿Offer-005】665. Non-decreasing Array

题目链接

 

题面：

 

 

Add to List

665. Non-decreasing Array

DescriptionHintsSubmissionsDiscussSolution

DiscussPick One

---

 

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

 

题意：即能否通过最多一次修改使得序列为非严格递增序列。

解题： 假设序列中Xi和Xi+1不符合要求，那么可做两种调整，即Xi=Xi+1或Xi+1=Xi，分别检验是否可行即可。

代码：

 

class Solution {
public:
    bool check(vector <int>& nums){
        for(int i=1;i<nums.size();i++){
            if(nums[i]<nums[i-1])
                return false;
        }
        return true;
    }
    bool checkPossibility(vector<int>& nums) {
        if(check(nums))return true;
        bool flag=false;
        for(int i=1;i<nums.size();i++){
            if(nums[i]<nums[i-1]){
                vector <int> v;
                for(int j=0;j<nums.size();j++)
                    v.push_back(nums[j]);
                v[i]=v[i-1];
                if(check(v))flag=true;
                else{
                    v[i-1]=v[i]=nums[i];
                     if(check(v))flag=true;
                }
                break;
            }
        }
        return flag;
    }
};