349. Intersection of Two Arrays

排序比对，简单

class Solution {public:    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {        sort(nums1.begin(),nums1.end());        sort(nums2.begin(),nums2.end());        set<int> result;        int index1=0;        int index2=0;        while(index1<nums1.size()&&index2<nums2.size())        {            if(nums1[index1]==nums2[index2])            {                result.insert(nums1[index1]);                //cout<<nums1[index1]<<endl;                index1++;                index2++;                //count++;            }            else if(nums1[index1]<nums2[index2])                index1++;            else                index2++;        }        vector<int> resultVec;        for(set<int>::iterator it=result.begin();it!=result.end();it++)            resultVec.push_back(*it);        return resultVec;    }};