【leetcode】【easy】349. Intersection of Two Arrays

349. Intersection of Two Arrays

Given two arrays, write a function to compute their intersection.

Example 1:

Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2]

Example 2:

Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]

Note:

• Each element in the result must be unique.
• The result can be in any order.

题目链接：https://leetcode.com/problems/intersection-of-two-arrays/

方法：使用set

考察了set的使用。

vector中find：复杂度高，少用了储存空间

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        set<int> record(nums1.begin(), nums1.end());
        vector<int> result;
        for (int i=0; i<nums2.size(); ++i){
            if(find(result.begin(),result.end(),nums2[i])!=result.end()) continue;
            if(record.find(nums2[i])!=record.end()) result.push_back(nums2[i]);
        }
        return result;
    }
};

set中find：复杂度低，多了set的储存空间

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        set<int> record(nums1.begin(), nums1.end());
        set<int> result;
        for (int i=0; i<nums2.size(); ++i){
            if(result.find(nums2[i])!=result.end()) continue;
            if(record.find(nums2[i])!=record.end()) result.insert(nums2[i]);
        }
        return vector<int>(result.begin(),result.end());
    }
};

TODO：需要了解下set和map在c++中的实现