One Leetcode per day-665. Non-decreasing sequence

class Solution {
    
    
    public boolean checkPossibility(int[] nums) {
    
    
        // 看是修改前面的值还是后面的值
        int count = 0;
        for(int i=1;i<nums.length;i++){
    
    
            if(nums[i]>=nums[i-1]) continue;
            else{
    
    
                count++;
                if(i-2>=0 && nums[i-2]>nums[i]){
    
    
                    nums[i] = nums[i-1];
                }else{
    
    
                    nums[i-1] = nums[i];
                }
            }
        }
        if(count<=1){
    
    
            return true;
        }else{
    
    
            return false;
        }
    }
}