2248. Intersection of Multiple Arrays
2022. 4. 29. 19:23ㆍAlgorithm/Leetcode, Lintcode, HackerRank, etc.
- 목차
반응형
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)반응형
'Algorithm > Leetcode, Lintcode, HackerRank, etc.' 카테고리의 다른 글
| 2244. Minimum Rounds to Complete All Tasks (0) | 2022.05.01 |
|---|---|
| 2243. Calculate Digit Sum of a String (0) | 2022.04.29 |
| 2138. Divide a String Into Groups of Size k (0) | 2022.01.22 |
| 2134. Minimum Swaps to Group All 1's Together II (0) | 2022.01.09 |
| 2133. Check if Every Row and Column Contains All Numbers (0) | 2022.01.09 |
