https://leetcode.com/problems/intersection-of-two-arrays/description/
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
set<int> st,temp;
vector<int> res;
for(int i=0; i<nums1.size(); i++) st.insert(nums1[i]);
for(int i=0; i<nums2.size(); i++){
if(st.count(nums2[i])&&!temp.count(nums2[i])){
res.push_back(nums2[i]);
temp.insert(nums2[i]);
}
}
return res;
}
};