public int removeDuplicates(int[] nums,int k) {
if (nums.length<=k)
return nums.length;
int l=k-1;
int tag=2;
for (int i=k;i<nums.length;i++)
{
if (nums[l-k+1]!=nums[i])
{
l++;
nums[l]=nums[i];
}
}
return l+1;
}
LeetCode附录01
最新推荐文章于 2024-07-12 18:12:33 发布