class Solution {
public int removeDuplicates(int[] nums) {
if(nums.length==0)//对空数组要特殊处理
return 0;
int i=1,j=1;
int currentNum= nums[0];
while(j<nums.length)
{
if(nums[j]!=currentNum)
{
nums[i]=nums[j];
currentNum = nums[j];
i++;
}
j++;
}
return i;
}
}
思路同 LeetCode 27
双指针,“慢指针”&“快指针”