在LeetCode上面运行了下,两种方法用的时间差不多,猜测是因为vector的迭代器就是普通指针,而数组首地址也可以看作指针,故两种方法效率差不多。
C++代码:
方法一:
#include <vector>
#include <iostream>
using namespace std;
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
//j遍历数组,如果nums[j]在位置j之前第一次出现,则将它保存到i+1的位置
int sz = nums.size();
if (sz <= 1)
return sz;
int i, j;
for (i=0,j=i+1;j<sz;++j)
{
if (nums[i] != nums[j])
{
nums[++i] = nums[j];
}
}
//去掉重复的数据
nums.resize(i+1);
//返回长度
return i+1;
}
};
int main()
{
Solution s;
vector<int> nums;
nums.push_back(1);
nums.push_back(1);
nums.push_back(2);
nums.push_back(4);
nums.push_back(5);
nums.push_back(5);
nums.push_back(5);
nums.push_back(6);
int len = s.removeDuplicates(nums);
cout<<len<<endl;
for (vector<int>::iterator it = nums.begin();it!= nums.end();++it)
{
cout<<*it<<'\t';
}
cout<<endl;
return 0;
}
解法二(用迭代器实现):
#include <vector>
#include <iostream>
using namespace std;
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if (nums.size() <= 1)
return nums.size();
vector<int>::iterator ita, itb;
for (ita = nums.begin(), itb = ita +1;itb != nums.end();++itb)
{
if (*ita != *itb)
{
*(++ita) = *itb;
}
}
nums.erase(++ita, itb);
return nums.size();
}
};
int main()
{
Solution s;
vector<int> nums;
nums.push_back(1);
nums.push_back(1);
nums.push_back(2);
nums.push_back(4);
nums.push_back(5);
nums.push_back(5);
nums.push_back(5);
nums.push_back(6);
int len = s.removeDuplicates(nums);
cout<<len<<endl;
for (vector<int>::iterator it = nums.begin();it!= nums.end();++it)
{
cout<<*it<<'\t';
}
cout<<endl;
return 0;
}