349. Intersection of Two Arrays（LeetCode）

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

Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].

Note:

Each element in the result must be unique.

The result can be in any order.

 1 class Solution {
 2 public:
 3     vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
 4         set<int> s;
 5         vector<int>::iterator ite;
 6         ite = nums2.begin();
 7         for (int i = 0; i < nums2.size(); i++)
 8         {
 9             ite = find(nums1.begin(), nums1.end(), nums2[i]);
10             if (ite != nums1.end())
11             {
12                 s.insert(*ite);
13 
14             }
15         }
16         vector<int> vet;
17         set<int>::iterator ite1;
18         for (ite1 = s.begin(); ite1 != s.end(); ite1++)
19         {
20             vet.push_back(*ite1);
21         }
22         return vet;
23     }
24 };