leetcode-贪心-665. 非递减数列

 

 

class Solution {
public:
    bool checkPossibility(vector<int>& nums) {
        vector<int> res;
        int count = 0;

        for(int i = 0; i < nums.size()-1; i++){
            if(nums[i]>nums[i+1]){
                count++;
                //cout<<"count:"<<count<<endl;
                if(count>=2)
                    return false;
                if(i==0||nums[i-1]<=nums[i+1])
                    nums[i] = nums[i+1];  // 比如1 4 2 变成1 2 2
                else
                    nums[i+1] = nums[i];  // 比如 2 4 3 变成 2 4 4
            }     
        }
        return true;
    }
};