leetcode

0 class Solution {

1 public:

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

3 int j = 1;

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

5 if (nums[i - 1] != nums[i]) nums[j++] = nums[i];

6 }

7 return j;

8 }

9 };