관리 메뉴

솜씨좋은장씨

[leetCode] 349. Intersection of Two Arrays (Python) 본문

Programming/코딩 1일 1문제

[leetCode] 349. Intersection of Two Arrays (Python)

솜씨좋은장씨 2020. 7. 30. 17:21
728x90
반응형

Given two arrays, write a function to compute their intersection.

 

Example 1:

Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2]

Example 2:

Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]

Note:

  • Each element in the result must be unique.
  • The result can be in any order.

Solution

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

 

 

SOMJANG/CODINGTEST_PRACTICE

1일 1문제 since 2020.02.07. Contribute to SOMJANG/CODINGTEST_PRACTICE development by creating an account on GitHub.

github.com

 

Comments