Algorithm/Leetcode, Lintcode, HackerRank, etc.

2248. Intersection of Multiple Arrays

Roiei 2022. 4. 29. 19:23
반응형

 

class Solution:
    def intersection(self, nums: List[List[int]]) -> List[int]:
        intr = set(nums[0])
        for num in nums[1:]:
            intr = intr & set(num)

        return sorted(intr)
반응형