• Home
• com.github.javadev
• leetcode-in-java
• 1.9
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0301_0400.s0368_largest_divisible_subset.readme.md Maven / Gradle / Ivy

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**.