349. Intersection of Two Arrays 难度：easy

题目：

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

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

程序：

class Solution {public:    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {        set<int> s;        vector<int> res;        sort(nums1.begin(),nums1.end());        sort(nums2.begin(),nums2.end());        int i = 0;        int j = 0;        while(i < nums1.size()&&j < nums2.size())        {            if(nums1[i] < nums2[j])                i++;            else if(nums1[i] > nums2[j])                j++;            else            {                s.insert(nums1[i]);                i++;                j++;            }        }        for(set<int>::iterator p = s.begin();p != s.end();p++)            res.push_back(*p);        return res;    }};