Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].
Note:
Subscribe to see which companies asked this question
class Solution { public: vector<int> intersection(vector<int>& nums1, vector<int>& nums2) { map<int, int> map; vector<int> ret; for (auto &e : nums1) map[e] = 1; for (auto &e : nums2) { if (map.find(e)!=map.end()&&map[e]==1) { ret.push_back(e); ++map[e]; } } return ret; } };
LeetCode 349. Intersection of Two Arrays
原文：http://www.cnblogs.com/csudanli/p/5890922.html