1.题目
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.
2.解题思想
(1)给出两个数组,求得他们的交集结果;
(2)遍历其中一个数组,取出里面的每一个数,与另一个数组中的数对比,如果存在,则存入一个新的数组中,最后输出这个新数组,得出的即为两者的交集;
3.代码
class Solution(object):
def intersection(self, nums1, nums2):
result = list()
for num in set(nums1) :
if num in nums2:
result.append(num)
return result