leetcode665 C++ 36ms 非递减数列 这题没啥意思

class Solution {
public:
    bool checkPossibility(vector<int>& nums) {

        if(nums.empty()){
            return false;
        }
        if(nums.size() == 1){
            return true;
        }
        int p = 0;
        int counter = 0;
        while(p<nums.size()-1){
            if(nums[p+1] < nums[p]){
                if(p == 0 || p+1 == nums.size() - 1){
                    counter++;
                }
                else{
                    if(nums[p-1] >= nums[p+1]){
                        nums[p+1] = nums[p];
                    }
                    else{
                        nums[p] = nums[p-1];
                    }
                    counter++;
                }
            }
            if(counter >= 2){
                return false;
            }
            p++;
        }
        return counter <=1;
    }
    
};

转载于:https://www.cnblogs.com/theodoric008/p/9453737.html