1. 数组并集
#include <iostream>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
/*
求两个数组的交集(三种方法)
1. 两个指针,判断三个大小
2. 两个map存,另一个map去找,value>1则说明重复
3. set标准库自带函数set_union(并集)set_intersection(交集)
*/
vector<int> fun1(vector<int> num1, vector<int> num2)
{
int len1 = num1.size();
int len2 = num2.size();
if (len1 == 0 || len2 == 0)
return vector<int>();
int index1 = 0, index2 = 0;
vector<int> res;
while (index1 < len1 && index2 < len2)
{
if (num1[index1] == num2[index2])
{
res.push_back(num1[index1]);
index1++;
index2++;
}
else if (num1[index1] > num2[index2])
index2++;
else
index1++;
}
return res;
}
vector<int> fun2(vector<int> num1, vector<int> num2)
{
int len1 = num1.size();
int len2 = num2.size();
if (len1 == 0 || len2 == 0)
return vector<int>();
vector<int> res;
map<int, int> map_num;
for (auto i : num1)
map_num[i]++;
for (auto j : num2) //
{
if (map_num[j] >= 1)
res.push_back(j);
}
return res;
}
vector<int> fun3(vector<int> num1, vector<int> num2)
{
int len1 = num1.size();
int len2 = num2.size();
if (len1 == 0 || len2 == 0)
return vector<int>();
multiset<int> n1(num1.begin(), num1.end());
multiset<int> n2(num2.begin(), num2.end());
vector<int> res;
// set_union(n1.begin(), n1.end(), n2.begin(), n2.end(), res.begin()); //这里有错
return res;
}
int main()
{
vector<int> num1{ 1, 2, 4, 5, 7, 8, 10, 12, 13 };
vector<int> num2{ 4, 6, 7 , 8, 10, 13};
vector<int> res = fun3(num1, num2);
for (auto i : res)
cout << i << " ";
cout << endl;
system("pause");
return 0;
}
2. 有序数组去重
#include <iostream>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
/*
有序数组去重
1. 两个指针i,j,相等j右移,不等j指向的数字拷贝到i+1
2. 直接vector拷贝到set中
*/
void fun1(vector<int> num)
{
int len = num.size();
if (len == 0)
return;
set<int> s(num.begin(), num.end());
for (auto i : s)
cout << i << " ";
cout << endl;
}
void fun2(vector<int> &num)
{
int len = num.size();
if (len == 0)
return;
int i = 0, j = 1;
while (j < len)
{
if (num[i] == num[j] && ++j);
else
{
num[i + 1] = num[j];
++i;
++j;
}
}
num.resize(i + 1);
for (auto p : num)
cout << p << " ";
cout << endl;
}
int main()
{
vector<int> num1{ 1, 2, 4, 4, 4, 8, 10, 12, 13 };
fun2(num1);
system("pause");
return 0;
}