遍历,对比,更新
class Solution {
public:
int removeDuplicates(vector& nums) {
if (nums.size()== 0) {
return 0;
}
int number = 0;
for (int i = 0; i < nums.size(); i++) {
if (nums[number] != nums[i]) {
number ++;
nums[number] = nums[i];
}
}
return (number +1);
}
};
LeetCode26删除排序数组中的重复项
最新推荐文章于 2022-10-10 11:25:14 发布