1、非递减数列
public boolean checkPossibility(int[] nums) {
int n=nums.length;
for (int i=0;i<n-1;i++){
int x=nums[i],y=nums[i+1];
if (x>y){
nums[i]=y;
if (isSorted(nums)) return true;
nums[i]=x;
nums[i+1]=x;
return isSorted(nums);
}
}
return true;
}
private static boolean isSorted(int[] nums){
int n=nums.length;
for (int i = 0; i < n-1; i++) {
if (nums[i]>nums[i+1]) return false;
}
return true;
}