题目链接这里
public class Solution {
public int removeDuplicates(int[] nums) {
if(nums==null||nums.length==0)
{
return 0;
}
int current;
current=nums[0];
int result=1;
int skip=0;
for(int i=1;i<nums.length;i++)
{
if(nums[i]!=current)
{
nums[i-skip]=nums[i];
current=nums[i];
result++;
}
else
{
skip++;
}
}
return result;
}
}