Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit dd308d2

Browse files
368. Largest Divisible Subset
1 parent f858e09 commit dd308d2

File tree

1 file changed

+19
-0
lines changed

1 file changed

+19
-0
lines changed

‎368. Largest Divisible Subset.kt

Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
class Solution {
2+
fun largestDivisibleSubset(nums: IntArray): List<Int> {
3+
if (nums.isEmpty()) {
4+
return emptyList()
5+
}
6+
nums.sort()
7+
val dp = mutableListOf<List<Int>>()
8+
for (i in nums.indices) {
9+
var maxSubset = emptyList<Int>()
10+
for (j in 0 until i) {
11+
if (nums[i] % nums[j] == 0 && dp[j].size > maxSubset.size) {
12+
maxSubset = dp[j]
13+
}
14+
}
15+
dp.add(maxSubset + listOf(nums[i]))
16+
}
17+
return dp.maxByOrNull { it.size } ?: emptyList()
18+
}
19+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /