ほぼ日刊競プロ leetcode　349. Intersection of Two Arrays

349. Intersection of Two Arrays

Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.

考えたこと

いわゆる積集合を出力すればイイのでset関数を使いandをとれば良いと考えた．

class Solution:
   def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
       return list(set(nums1) & set(nums2))