1
class Solution {
2
  public int removeDuplicates(int[] nums) {
3
    int index = 1;
4
    int count = 0;
5
    for (int i = 1; i < nums.length; i++) {
6
      if (nums[i] == nums[i - 1]) {
7
        count++;
8
      } else {
9
        count = 0;
10
      }
11

12
      if (count <= 1) {
13
        nums[index] = nums[i];
14
        index++;
15
      }
16
    }
17
    return index;
18
  }
19
}