目录
0.题目描述
1.解题分析
思路是:因为不能使用额外空间,要在原地修改原数组,那么在遍历数组的时候用一个变量pos记录当前可修改的位置。然后遍历数组nums,当nums[i] == nums[i+1]时,i++。直到前后两个数字不同时,将nums[i]赋给nums[pos],pos++。
实现代码:
int removeDuplicates(vector<int>& nums) {
int pos = 0, len = nums.size();
if (len != 0) {
for (int i = 0; i < len; i++) {
if (i == len - 1) {
nums[pos++] = nums[i];
break;
}
if (nums[i] != nums[i + 1]) {
nums[pos++] = nums[i];
continue;
}
else {
while (i < len - 1)
{
i++;
if (nums[i] != nums[i + 1]) {
if (pos < len) {
nums[pos++] = nums[i];
}
break;
}
}
}
}
}
return pos;
}
简化逻辑后:
int removeDuplicates(vector<int>& nums) {
int pos = 0, len = nums.size();
if (len != 0) {
for (int i = 0; i < len; i++) {
while (nums[i] == nums[i + 1] && i < len - 1)
i++;
nums[pos++] = nums[i];
}
}
return pos;
}
复杂度分析:
- 时间复杂度:O(n)
- 空间复杂度:O(1)
2.优质范例
lass Solution {
public:
int removeDuplicates(vector<int>& nums) {
int size = nums.size();
if(size == 0 || size == 1) return size;
int slow = 0, elem = nums[0], fast = 1;
while(fast < size){
if(nums[fast] == elem) ++ fast;
else{
if(slow + 1 < fast) {
nums[slow + 1] = nums[fast];
}
++ fast;
++ slow;
elem = nums[slow];
}
}
return slow + 1;
}
};
static auto io_sync_off = [](){
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
return nullptr;
}();