349. 两个数组的交集

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        set<int> num1;
        set<int> num2;
        vector<int> arr;
        int i = 0;
        num1.insert(nums1.cbegin(), nums1.cend());
        num2.insert(nums2.cbegin(), nums2.cend());
        for (const auto &p : num1)
        {
            if (num2.find(p) != num2.end())
            {
                arr.push_back(p);
            }
        }
        return arr;
    }
};