text: # coding: utf8
  
  
  """
      题目链接: https://leetcode.com/problems/intersection-of-two-arrays/description.
      题目描述:
  
      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.
  
  """
  
  
  class Solution(object):
      def intersection(self, nums1, nums2):
          """
          :type nums1: List[int]
          :type nums2: List[int]
          :rtype: List[int]
          """
          if not nums1 or not nums2:
              return []
  
          # 交集
          return list(set(nums1) & set(nums2))
  