程式語言 - LeetCode - C++ - 2540. Minimum Common Value



題目:


解答:

class Solution {
public:
    int getCommon(vector<int>& nums1, vector<int>& nums2) {
        unordered_map<int, int> mp;

        for (int n : nums1) {
            mp[n] += 1;
        }

        for (int n : nums2) {
            if (mp.count(n)) {
                return n;
            }
        }

        return -1;
    }
};