# leetcode 2248. Intersection of Multiple Arrays（python）

·  阅读 894

### 描述

Given a 2D integer array nums where nums[i] is a non-empty array of distinct positive integers, return the list of integers that are present in each array of nums sorted in ascending order.

Example 1:

``````Input: nums = [[3,1,2,4,5],[1,2,3,4],[3,4,5,6]]
Output: [3,4]
Explanation:
The only integers present in each of nums[0] = [3,1,2,4,5], nums[1] = [1,2,3,4], and nums[2] = [3,4,5,6] are 3 and 4, so we return [3,4].

Example 2:

``````Input: nums = [[1,2,3],[4,5,6]]
Output: []
Explanation:
There does not exist any integer present both in nums[0] and nums[1], so we return an empty list [].

Note:

``````1 <= nums.length <= 1000
1 <= sum(nums[i].length) <= 1000
1 <= nums[i][j] <= 1000
All the values of nums[i] are unique.

### 解答

``````class Solution(object):
def intersection(self, nums):
"""
:type nums: List[List[int]]
:rtype: List[int]
"""
result = set(i for i in range(1001))
for num in nums:
result &= set(num)
return sorted(list(result))

### 运行结果

``````151 / 151 test cases passed.
Status: Accepted
Runtime: 96 ms
Memory Usage: 13.8 MB

### 原题链接

leetcode.com/contest/wee…