题目
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.
题意
两数组的交集
题解
遍历nums1中的元素nums1[i],判断nums1[i]是否在nums2数组中,如在,放入结果set集合中(set去重),z最后遍历set,将结果放入vector容器中。
C++代码
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
set<int>s;
for(int i=0; i<nums1.size(); i++)
{
if(find(nums2.begin(), nums2.end(), nums1[i]) != nums2.end())
s.insert(nums1[i]);
}
set<int>::iterator it;
vector<int>res;
for(it=s.begin(); it!=s.end(); it++)
{
res.push_back(*it);
}
return res;
}
};
python代码
class Solution(object):
def intersection(self, nums1, nums2):
"""
:type nums1: List[int]
:type nums2: List[int]
:rtype: List[int]
"""
s = set()
for i in range(0, len(nums1)):
if nums1[i] in nums2:
s.add(nums1[i])
res = list(s)
return res
python代码更简单