LeetCode 349 两个数组的交集

class Solution {
public:
    bool record[1010];
    vector<int> res;
    

    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        unordered_set<int> set(nums1.begin(), nums1.end());

        for (int num : nums2) {
            if (set.find(num) != set.end() && !record[num]) {
                res.push_back(num);
                record[num] = true;
            } 
        }    
        return res;
    }
};