Package g0301_0400.s0368_largest_divisible_subset

Class Solution

java.lang.Object

g0301_0400.s0368_largest_divisible_subset.Solution

public class Solution
extends Object

368 - Largest Divisible Subset\. Medium 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] **Constraints:** * `1 <= nums.length <= 1000` * 1 <= nums[i] <= 2 * 109 * All the integers in `nums` are **unique**.

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
List<Integer>	largestDivisibleSubset(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

largestDivisibleSubset

public List<Integer> largestDivisibleSubset(int[] nums)