#2248

Intersection of Multiple Arrays

pupil · 300 · lc easy +20 · verified · 68.7% accepted · 806 likes · top 76%

Description

You are given a 2D integer array nums where each nums[i] is a non-empty array of distinct positive integers. Return a sorted list of all integers that appear in every row of nums.

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 [].

Code

1

2

3

class Solution:
    def intersection(self, nums: List[List[int]]) -> List[int]:

class Solution:
    def intersection(self, nums: List[List[int]]) -> List[int]: