leetcode - 80.Remove Duplicates from Sorted Array II

Remove Duplicates from Sorted Array II

Follow up for “Remove Duplicates”:
What if duplicates are allowed at most twice?

For example,
Given sorted array nums = [1,1,1,2,2,3],

Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3. It doesn’t matter what you leave beyond the new length.

Solution1:

  public int removeDuplicates(int[] nums) {
    if (nums.length == 0) {
      return 0;
    }
    int len = 1;
    int flag = 1;
    for (int i = 1; i < nums.length; i++) {
      if (nums[i] == nums[i - 1] && flag == 0) {
        continue;
      }

      if (nums[i] == nums[i - 1]) {
        flag = 0;
      } else {
        flag = 1;
      }
      nums[len++] = nums[i];
    }

    return len;
  }

Solution2:

better

“`java
public int removeDuplicates(int[] nums) {
int len = 0;
for (int i : nums) {
if (len < 2 || i > nums[len - 2]) {
nums[len++] = i;
}
}

return len;

}
““