【Leetcode】349. Intersection of Two Arrays两个数组的交集

349. Intersection of Two Arrays两个数组的交集
     Given two arrays, write a function to compute their intersection.
     Example 1:
     Input: nums1 = [1,2,2,1], nums2 = [2,2]
     Output: [2]
     Example 2:
     Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
     Output: [9,4]
     Note:
     Each element in the result must be unique.
     The result can be in any order.
     【思路】
     方法一，暴力解法，先排序，然后依次比较
     方法二，运用hash表，但好像复杂度也差不多

代码1：

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {        
        sort(nums1.begin(),nums1.end());
         sort(nums2.begin(),nums2.end());
         vector<int> result;
            int i =0 ,j=0;
            while( i < nums1.size()&& j < nums2.size() )
            {
                if(nums1[i] > nums2[j])
                    j++;
                else if(nums1[i] < nums2[j])
                       i++;
                      else 
                      {
                          int n= result.size();
                          cout<<n<<endl;
                          if(n == 0 ||nums1[i] != result[n-1])  //相同的数字就不用保留
                              result.push_back(nums1[i]);
                          i++;
                          j++;
                      }                    
            }
        return result;
    }
};

代码2：

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) { 
        unordered_map< int ,int > re;
        vector<int> result;      
        for( int  i = 0; i < nums1.size();i++)
        {
            re[nums1[i]] =i;
        }
        sort(nums2.begin(),nums2.end());
        for(int  i = 0; i < nums2.size();i++)
        {
           
               if(i != 0 && nums2[i] == nums2[i-1])
                 continue;
            if(re.count(nums2[i]))
                result.push_back(nums2[i]);                      
        }        
      return result;          
    }
};