leetcode---Intersection of Two Arrays

Total Accepted: 77145
Total Submissions: 166815
Difficulty: Easy
Contributors: Admin
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.

class Solution {public:    vector<int> intersection(vector<int>& nums1, vector<int>& nums2)     {        set<int> s1;        set<int> s2;        for(int i=0; i<nums1.size(); i++)            s1.insert(nums1[i]);        for(int i=0; i<nums2.size(); i++)            s2.insert(nums2[i]);        vector<int> s;        set_intersection(s1.begin(), s1.end(), s2.begin(), s2.end(), back_inserter(s));        return s;    }};