1213. 三个有序数组的交集

    技术2023-07-26  71

    vector<int> arraysIntersection(vector<int> &arr1, vector<int> &arr2, vector<int> &arr3) { map<int, int> m1; unordered_map<int, int> m2, m3; for (auto it:arr1) m1[it]++; for (auto it:arr2) m2[it]++; for (auto it:arr3) m3[it]++; vector<int> ret; for (auto it:m1) if (m2.find(it.first) != m2.end() && m3.find(it.first) != m3.end()) ret.emplace_back(it.first); return ret; }
    Processed: 0.010, SQL: 10