Leetcode 349. Intersection of Two Arrays (Easy) (cpp)
Tag: Hash Table, Two Pointers, Binary Search, Sort
Difficulty: Easy
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
vector<int> result;
if (nums1.empty() || nums2.empty()) return result;
unordered_map<int, bool> mapping;
for (auto i : nums1) {
mapping[i] = true;
}
for (auto i : nums2) {
if (mapping[i]) {
result.push_back(i);
mapping.erase(i);
}
}
return result;
}
};