题目原文:
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.
题目大意:
给出两个数组,求他们的交集,相同元素只出现一次。
题目分析:
用python的set最好做。
源码:(language:python)
class Solution(object):
def intersection(self, nums1, nums2):
return list(set(nums1) & set(nums2))
成绩:
60ms