题目描述
解题思路
快慢指针;
题解
/*
time: O(n)
space:O(1)
*/
class Solution {
public:
int removeDuplicates(vector<int>& nums)
{
int len = nums.size();
if(len < 1) return len;
int fast = 1, slow = 1;
while(fast < len)
{
if(nums[fast] != nums[fast - 1])
{
nums[slow] = nums[fast];
++slow;
}
++fast;
}
return slow;
}
};