两个std::unordered_map的交集

#include <iostream>
#include <unordered_map>
#include <vector>

std::unordered_map<int, std::string> getIntersection(const std::unordered_map<int, std::string>& map1, const std::unordered_map<int, std::string>& map2) {
    std::unordered_map<int, std::string> intersection;
    
    for (const auto& pair : map1) {
        if (map2.count(pair.first) > 0) {
            intersection.insert(pair);
        }
    }
    
    return intersection;
}

int main() {
    std::unordered_map<int, std::string> map1 = {{1, "apple"}, {2, "banana"}, {3, "orange"}};
    std::unordered_map<int, std::string> map2 = {{2, "banana"}, {3, "orange"}, {4, "grape"}};
    
    std::unordered_map<int, std::string> intersection = getIntersection(map1, map2);
    
    for (const auto& pair : intersection) {
        std::cout << pair.first << ": " << pair.second << std::endl;
    }
    
    return 0;
}