349. 两个数组的交集

class Solution {
public:
    set<int>st;
    set<int>st1;
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        for(auto t:nums1){
            st.insert(t);
        }
        vector<int>ans;
        for(auto t:nums2){
            if(st.count(t)){
                if(!st1.count(t)){
                    st1.insert(t);
                    ans.push_back(t);
                }
            }
        }
        return ans;
    }
};