如何在C ++中使用STL在两个数组之间查找公共元素？
在本教程中，我们将讨论一个程序，以了解如何使用C++中的STL在两个数组之间查找公共元素。
为了找到两个给定数组之间的公共元素，我们将使用set_intersetion()方法。
示例
#include <bits/stdc++.h>
using namespace std;
int main(){
//定义数组
int arr1[] = { 1, 45, 54, 71, 76, 12 };
int arr2[] = { 1, 7, 5, 4, 6, 12 };
int n1 = sizeof(arr1) / sizeof(arr1[0]);
int n2 = sizeof(arr2) / sizeof(arr2[0]);
sort(arr1, arr1 + n1);
sort(arr2, arr2 + n2);
cout << "First Array: ";
for (int i = 0; i < n1; i++)
cout << arr1[i] << " ";
cout << endl;
cout << "Second Array: ";
for (int i = 0; i < n2; i++)
cout << arr2[i] << " ";
cout << endl;
vector<int> v(n1 + n2);
vector<int>::iterator it, st;
//寻找共同点
it = set_intersection(arr1, arr1 + n1, arr2, arr2 + n2, v.begin());
cout << "\nCommon elements:\n";
for (st = v.begin(); st != it; ++st)
cout << *st << ", ";
cout << '\n';
return 0;
}输出结果
First Array: 1 12 45 54 71 76 Second Array: 1 4 5 6 7 12 Common elements: 1, 12,