class Solution {
public int removeDuplicates(int[] nums) {
int k = 1;
int num = nums[0];
int numCnt = 1;
for (int i = 1 ; i < nums.length ; i ++) {
if (nums[i] != num) {
nums[k ++] = nums[i];
num = nums[i];
numCnt = 1;
} else if (numCnt == 1) {
numCnt ++;
nums[k ++] = nums[i];
}
}
return k;
}
}