Movatterモバイル変換

[0]ホーム
URL:

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

Commit91f7d57

Browse files
add a solution for 368
1 parentb231cfb commit91f7d57

File tree

2 files changed

+84
-45
lines changed

2 files changed

+84
-45
lines changed

‎src/main/java/com/fishercoder/solutions/_368.java

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -7,6 +7,41 @@
77
publicclass_368 {
88

99
publicstaticclassSolution1 {
10+
/**
11+
* DP solution, credit: https://leetcode.com/problems/largest-divisible-subset/solution/ Solution 1
12+
*/
13+
publicList<Integer>largestDivisibleSubset(int[]nums) {
14+
List<List<Integer>>lists =newArrayList<>();
15+
Arrays.sort(nums);
16+
intlen =nums.length;
17+
if (len ==0) {
18+
returnnewArrayList<>();
19+
}
20+
for (inti =0;i <len;i++) {
21+
lists.add(newArrayList<>());
22+
}
23+
for (inti =0;i <len;i++) {
24+
List<Integer>maxSubset =newArrayList<>();
25+
for (intk =0;k <i;k++) {
26+
if (nums[i] %nums[k] ==0 &&maxSubset.size() <lists.get(k).size()) {
27+
maxSubset =lists.get(k);
28+
}
29+
}
30+
lists.get(i).addAll(maxSubset);
31+
lists.get(i).add(nums[i]);
32+
}
33+
List<Integer>ans =newArrayList<>();
34+
for (List<Integer>list :lists) {
35+
if (list.size() >ans.size()) {
36+
ans.clear();
37+
ans.addAll(list);
38+
}
39+
}
40+
returnans;
41+
}
42+
}
43+
44+
publicstaticclassSolution2 {
1045
/**
1146
* Credit: https://discuss.leetcode.com/topic/49652/classic-dp-solution-similar-to-lis-o-n-2
1247
*/

‎src/test/java/com/fishercoder/_368Test.java

Lines changed: 49 additions & 45 deletions
Original file line numberDiff line numberDiff line change
@@ -6,51 +6,55 @@
66

77
importjava.util.Arrays;
88

9-
importstaticorg.hamcrest.core.Is.is;
10-
importstaticorg.junit.Assert.assertThat;
9+
importstaticorg.junit.Assert.assertEquals;
1110

1211
publicclass_368Test {
13-
privatestatic_368.Solution1solution1;
14-
privatestaticint[]nums;
15-
16-
@BeforeClass
17-
publicstaticvoidsetup() {
18-
solution1 =new_368.Solution1();
19-
}
20-
21-
@Test
22-
publicvoidtest1() {
23-
nums =newint[] {1,2,4,8};
24-
assertThat(solution1.largestDivisibleSubset(nums),is(Arrays.asList(8,4,2,1)));
25-
}
26-
27-
@Test
28-
publicvoidtest2() {
29-
nums =newint[] {1,2,3};
30-
assertThat(solution1.largestDivisibleSubset(nums),is(Arrays.asList(2,1)));
31-
}
32-
33-
@Test
34-
publicvoidtest3() {
35-
nums =newint[] {1};
36-
assertThat(solution1.largestDivisibleSubset(nums),is(Arrays.asList(1)));
37-
}
38-
39-
@Test
40-
publicvoidtest4() {
41-
nums =newint[] {546,669};
42-
assertThat(solution1.largestDivisibleSubset(nums),is(Arrays.asList(546)));
43-
}
44-
45-
@Test
46-
publicvoidtest5() {
47-
nums =newint[] {};
48-
assertThat(solution1.largestDivisibleSubset(nums),is(Arrays.asList()));
49-
}
50-
51-
@Test
52-
publicvoidtest6() {
53-
nums =newint[] {4,8,10,240};
54-
assertThat(solution1.largestDivisibleSubset(nums),is(Arrays.asList(240,8,4)));
55-
}
12+
privatestatic_368.Solution1solution1;
13+
privatestatic_368.Solution2solution2;
14+
privatestaticint[]nums;
15+
16+
@BeforeClass
17+
publicstaticvoidsetup() {
18+
solution1 =new_368.Solution1();
19+
solution2 =new_368.Solution2();
20+
}
21+
22+
@Test
23+
publicvoidtest1() {
24+
nums =newint[]{1,2,4,8};
25+
assertEquals(Arrays.asList(1,2,4,8),solution1.largestDivisibleSubset(nums));
26+
assertEquals(Arrays.asList(8,4,2,1),solution2.largestDivisibleSubset(nums));
27+
}
28+
29+
@Test
30+
publicvoidtest2() {
31+
nums =newint[]{1,2,3};
32+
assertEquals(solution1.largestDivisibleSubset(nums),Arrays.asList(1,2));
33+
assertEquals(solution2.largestDivisibleSubset(nums),Arrays.asList(2,1));
34+
}
35+
36+
@Test
37+
publicvoidtest3() {
38+
nums =newint[]{1};
39+
assertEquals(solution1.largestDivisibleSubset(nums),Arrays.asList(1));
40+
}
41+
42+
@Test
43+
publicvoidtest4() {
44+
nums =newint[]{546,669};
45+
assertEquals(solution1.largestDivisibleSubset(nums),Arrays.asList(546));
46+
}
47+
48+
@Test
49+
publicvoidtest5() {
50+
nums =newint[]{};
51+
assertEquals(solution1.largestDivisibleSubset(nums),Arrays.asList());
52+
}
53+
54+
@Test
55+
publicvoidtest6() {
56+
nums =newint[]{4,8,10,240};
57+
assertEquals(solution1.largestDivisibleSubset(nums),Arrays.asList(4,8,240));
58+
assertEquals(solution2.largestDivisibleSubset(nums),Arrays.asList(240,8,4));
59+
}
5660
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp