leetcode

0 class Solution {

1 public:

2 int removeDuplicates(vector<int> &nums) {

3 int k = 1;

4 for (int i = 1; i < nums.size(); i++) {

5 nums[k++] = nums[i];

6 if (nums[i] == nums[i - 1]) {

7 while (++i < nums.size() && nums[i] == nums[k - 2])

8 ;

9 i--;

10 }

11 }

12 return k;

13 }

14 };