1
class Solution {
2
 public:
3
  int removeDuplicates(vector<int> &nums) {
4
    int l = 1;
5
    int last_selected = nums[0];
6
    int count = 1;
7
    int n = nums.size();
8
    for (int i = 1; i < n; i++) {
9
      if (nums[i] != last_selected) {
10
        count = 1;
11
        last_selected = nums[i];
12
        nums[l] = nums[i];
13
        l++;
14
      } else if (count == 2) {
15
        continue;
16
      } else {
17
        nums[l] = nums[i];
18
        l++;
19
        count++;
20
      }
21
    }
22
    return (l);
23
  }
24
};