每日一题ing,今天是个medium题665. Non-decreasing Array
class Solution {
public:
bool checkPossibility(vector<int>& nums) {
int len=nums.size(),count=0;
if(len<=1){
return true;
}
for(int i=1;i<len;i++)
{
if(nums[i]>=nums[i-1])
{
continue;
}
count++;
if (i-2>=0 && nums[i-2] > nums[i]) {
nums[i] = nums[i-1];
}else{
nums[i-1] = nums[i];
}
}
return count<=1;
}
};