class Solution {
public int removeDuplicates(int[] nums) {
int n = nums.length;
if(n == 0){
return 0;
}
int fast = 1,solw = 1;
while( fast < n ){
if (nums[fast] != nums[fast-1]){
nums[solw] = nums[fast];
solw++;
}
fast++;
}
return solw;
}
}
leetcode —— 双指针
最新推荐文章于 2024-01-20 16:24:19 发布