#368

Largest Divisible Subset

specialist · 875 · lc medium +31 · verified · 49.4% accepted · 6,841 likes · top 36%

Description

Given a set of distinct positive integers nums, return the largest subset answer such that every pair (answer[i], answer[j]) of elements in this subset satisfies:

- answer[i] % answer[j] == 0, or

- answer[j] % answer[i] == 0

If there are multiple solutions, return any of them.

Example 1:

Input: nums = [1,2,3]

Output: [1,2]

Explanation: [1,3] is also accepted.

Example 2:

Input: nums = [1,2,4,8]

Output: [1,2,4,8]

Code

1

2

3

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

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