1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
| #include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { vector<int> v1 = {1, 2, 3, 4, 5}; vector<int> v2 = {3, 4, 5, 6, 7}; vector<int> result;
set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(result)); for (int x : result) cout << x << " "; cout << endl;
result.clear();
set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(result)); for (int x : result) cout << x << " "; cout << endl;
result.clear();
set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(result)); for (int x : result) cout << x << " "; cout << endl;
return 0; }
|