Skip to content

Instantly share code, notes, and snippets.

@vrat28
Created May 4, 2021 13:13
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save vrat28/c67aa68f904139e53b7fd26d178a81f1 to your computer and use it in GitHub Desktop.
Save vrat28/c67aa68f904139e53b7fd26d178a81f1 to your computer and use it in GitHub Desktop.
Check Possibility
class Solution {
public boolean checkPossibility(int[] nums) {
int count = 0;
for (int i=1; i<nums.length;i++){
if (nums[i]<nums[i-1]){
if(i == 1 || nums[i-2] <= nums[i]) {
nums[i-1] = nums[i];
}
else{
nums[i] = nums[i-1];
}
count++;
}
}
return count < 2;
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment