Skip to content

Instantly share code, notes, and snippets.

Show Gist options
  • Save Siyu-Lei/2dd05c9e4fee8e5badc2b759c67644cc to your computer and use it in GitHub Desktop.
Save Siyu-Lei/2dd05c9e4fee8e5badc2b759c67644cc to your computer and use it in GitHub Desktop.
public class Solution {
public int removeDuplicates(int[] nums) {
int i = 0;
for (int n = 0; n < nums.length; n++) {
if(i < 2 || nums[n] > nums[i - 2]) {
nums[i++] = nums[n];
}
}
return i;
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment