这道题目和leetcode88 合并2个有序数组有点类似,可以放在一起练习。
C++代码如下:
#include<iostream> #include<vector> #include <set> #include <algorithm> using namespace std; int main() { int m = 0; while (cin >> m) { set<int> set; int temp = 0; vector<int> result = {}; for (int i = 0; i < m; i++) { cin >> temp; if (set.count(temp) == 0) { set.insert(temp); result.push_back(temp); } } int n = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> temp; if (set.count(temp) == 0) { set.insert(temp); result.push_back(temp); } } sort(result.begin(), result.end()); for (int i = 0; i < result.size(); i++) { cout << result[i]; } cout << endl; } return 0; }