本文介绍了一个C++实现的算法，该算法用于从整数数组中去除重复元素，并返回处理后的数组长度。通过遍历数组并将非重复元素移至数组前端，有效提升了数据处理效率。
#include<iostream>
#include<vector>
using namespace std;
class Solution
{
public:
int removeDuplicates(vector<int>&nums)
{
if (nums.empty())
return 0;
int index = 0;
for (int i = 1; i < nums.size(); i++)
{
if (nums[index] != nums[i])
nums[++index] = nums[i];
}
return index + 1;
}
};
int main()
{
vector<int>nums = { 1, 1, 2, 3, 4, 4, 5, 6, 7 };
Solution c;
cout << "数组的长度:" << c.removeDuplicates(nums)<< endl;
system("pause");
return 0;
#include<vector>
using namespace std;
class Solution
{
public:
int removeDuplicates(vector<int>&nums)
{
if (nums.empty())
return 0;
int index = 0;
for (int i = 1; i < nums.size(); i++)
{
if (nums[index] != nums[i])
nums[++index] = nums[i];
}
return index + 1;
}
};
int main()
{
vector<int>nums = { 1, 1, 2, 3, 4, 4, 5, 6, 7 };
Solution c;
cout << "数组的长度:" << c.removeDuplicates(nums)<< endl;
system("pause");
return 0;
}
运行结果:
扫一扫
1827
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
