Leetcode 非递减数列

代码如下
package bad;

public class cheCk {
public boolean checkPossibility(int[] nums){
int cnt=0;
for(int i=0;i<nums.length-1;i++){//注意 如果忘记-1会出现数组越界的情况
if(nums[i]>nums[i+1]){
int tmp=nums[i];
if(i>=1){
nums[i]=nums[i-1];
}else {
nums[i]=nums[i+1];
}if(nums[i]>nums[i+1]){
nums[i]=tmp;
nums[i+1]=nums[i];
}
cnt++;
if(cnt==2){
return false;
}
}
}
return true;
}
public static void main(String[] args){
cheCk r=new cheCk();
int[] nums={5,1,2,4};
r.checkPossibility(nums);
System.out.println(r.checkPossibility(nums));
}
}