public int removeDuplicates(int[] nums)
{
int j = 1; // 慢指针
for (int i=1; i<nums.length; i++)
{
if (nums[i] != nums[i-1])
{
nums[j++] = nums[i];
}
}
return j;
}
public int removeDuplicates(int[] nums)
{
int j = 1; // 慢指针
for (int i=1; i<nums.length; i++)
{
if (nums[i] != nums[i-1])
{
nums[j++] = nums[i];
}
}
return j;
}