试题链接
实现效果
代码如下：
class Solution {
public int removeDuplicates(int[] nums) {
if(nums.length<=0){
return 0;
}
int temp = nums[0];
int count = 0;
for(int i = 1;i < nums.length;++i){
if(nums[i] != temp){
temp = nums[i];
nums[i-count] = temp;
}else{
++count;
}
}
return nums.length-count;
}
}
