题目
代码
class Solution {
public int removeDuplicates(int[] nums) {
int cur = 0, next = 0;// next存放下一个不重复数字的位置
while (cur < nums.length) {
if (cur + 1 < nums.length && nums[cur] == nums[cur + 1]) {
cur++;
} else {
nums[next] = nums[cur];
next++;
cur++;
}
}
return next;
}
}