解题思路:
朋友,买挂吗?
注意事项:
参考代码:
#include <iostream> #include <iterator> #include <vector> #include <algorithm> #include <set> #include <string> #include <stdio.h> #define N 6 using namespace std; set<int> A, B, U, I, C; int main(int argc, char** argv) { int n = 0, m = 0, i = 0, temp = 0; cin >> n; for (i = 0; i < n; i++) { cin >> temp; A.insert(temp); } cin >> m; for (i = 0; i < m; i++) { cin >> temp; B.insert(temp); } set_union(A.begin(), A.end(), B.begin(), B.end(), inserter(U, U.begin())); set_intersection(A.begin(), A.end(), B.begin(), B.end(), inserter(I, I.begin())); set_difference(A.begin(), A.end(), B.begin(), B.end(), inserter(C, C.begin())); set<int>::iterator it; for (it = I.begin(), i = 0; it != I.end(); it++, i++) { if (i == I.size() - 1) cout << *it << endl; else cout << *it << " "; } for (it = U.begin(), i = 0; it != U.end(); it++, i++) { if (i == U.size()-1) cout << *it << endl; else cout << *it << " "; } for (it = C.begin(), i = 0; it != C.end(); it++, i++) { if (i == C.size()-1) cout << *it << endl; else cout << *it << " "; } return 0; }
0.0分
0 人评分