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.<p>Medium</p> <p>Given a set of <strong>distinct</strong> positive integers <code>nums</code>, return the largest subset <code>answer</code> such that every pair <code>(answer[i], answer[j])</code> of elements in this subset satisfies:</p> <ul> <li><code>answer[i] % answer[j] == 0</code>, or</li> <li><code>answer[j] % answer[i] == 0</code></li> </ul> <p>If there are multiple solutions, return any of them.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,2,3]</p> <p><strong>Output:</strong> [1,2]</p> <p><strong>Explanation:</strong> [1,3] is also accepted.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1,2,4,8]</p> <p><strong>Output:</strong> [1,2,4,8]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 1000</code></li> <li><code>1 <= nums[i] <= 2 * 10⁹</code></li> <li>All the integers in <code>nums</code> are <strong>unique</strong>.</li> </ul>

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)