题目
代码(首刷自解)
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
int slow = 0, fast = 0;
while(fast != nums.size()) {
if(nums[fast] == nums[slow]) {
fast++;
} else {
nums[++slow] = nums[fast];
fa#st++;
}
}
return slow+1;
}
};
代码(9.13 二刷看解析)
状态不是很好,心情不是很好
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
int i = 0, j = 0;
while(j < nums.size()) {
if(nums[j] == nums[i]) {
j++;
} else {
nums[++i] = nums[j++];
}
}
return i+1;
}
};