class Solution {
public int removeDuplicates(int[] nums) {
int slow = 0;
for(int fast=1; fast<nums.length; fast++){
if(nums[fast] != nums[slow]){
slow++;
nums[slow] = nums[fast];
}
}
return slow+1;
}
}
26、删除有序数组中重复元素
最新推荐文章于 2024-07-12 18:02:43 发布