Largest Divisible Subset
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, oranswer[j] % answer[i] == 0
If there are multiple solutions, return any of them.
Example 1
Input
nums = [1,2,3]Output
[1,2][1,3] is also accepted.
Example 2
Input
nums = [1,2,4,8]Output
[1,2,4,8]All elements can be included because each smaller element divides the next larger element in the subset.
Constraints
- 1 <= nums.length <= 1000
- 1 <= nums[i] <= 2 * 10^9
- All the integers in
numsare unique.