665-Non-decreasing Array.cpp

//like greedy
class Solution {
public:
    bool checkPossibility(vector<int>& nums) {
        int count=0,count2=0;
        for(int i=1;i<nums.size()&&count<2;i++)
        {
            if(nums[i]<nums[i-1])
            {
                count++;
                if(i-2<0||nums[i-2]<=nums[i])
                    nums[i-1]=nums[i];
                else 
                    nums[i]=nums[i-1];
                
            }
        }       
        if(count>=2)
            return false;
       
        return true;
        
    }
};