add a solution for 368

fishercoder1534 · fishercoder1534 · commit 91f7d578f672 · 2021-11-15T07:43:27.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_368.java b/src/main/java/com/fishercoder/solutions/_368.java
@@ -7,6 +7,41 @@
 public class _368 {
 
     public static class Solution1 {
+        /**
+         * DP solution, credit: https://leetcode.com/problems/largest-divisible-subset/solution/ Solution 1
+         */
+        public List<Integer> largestDivisibleSubset(int[] nums) {
+            List<List<Integer>> lists = new ArrayList<>();
+            Arrays.sort(nums);
+            int len = nums.length;
+            if (len == 0) {
+                return new ArrayList<>();
+            }
+            for (int i = 0; i < len; i++) {
+                lists.add(new ArrayList<>());
+            }
+            for (int i = 0; i < len; i++) {
+                List<Integer> maxSubset = new ArrayList<>();
+                for (int k = 0; k < i; k++) {
+                    if (nums[i] % nums[k] == 0 && maxSubset.size() < lists.get(k).size()) {
+                        maxSubset = lists.get(k);
+                    }
+                }
+                lists.get(i).addAll(maxSubset);
+                lists.get(i).add(nums[i]);
+            }
+            List<Integer> ans = new ArrayList<>();
+            for (List<Integer> list : lists) {
+                if (list.size() > ans.size()) {
+                    ans.clear();
+                    ans.addAll(list);
+                }
+            }
+            return ans;
+        }
+    }
+
+    public static class Solution2 {
         /**
          * Credit: https://discuss.leetcode.com/topic/49652/classic-dp-solution-similar-to-lis-o-n-2
          */
diff --git a/src/test/java/com/fishercoder/_368Test.java b/src/test/java/com/fishercoder/_368Test.java
@@ -6,51 +6,55 @@
 
 import java.util.Arrays;
 
-import static org.hamcrest.core.Is.is;
-import static org.junit.Assert.assertThat;
+import static org.junit.Assert.assertEquals;
 
 public class _368Test {
-  private static _368.Solution1 solution1;
-  private static int[] nums;
-
-  @BeforeClass
-  public static void setup() {
-    solution1 = new _368.Solution1();
-  }
-
-  @Test
-  public void test1() {
-    nums = new int[] {1, 2, 4, 8};
-    assertThat(solution1.largestDivisibleSubset(nums), is(Arrays.asList(8, 4, 2, 1)));
-  }
-
-  @Test
-  public void test2() {
-    nums = new int[] {1, 2, 3};
-    assertThat(solution1.largestDivisibleSubset(nums), is(Arrays.asList(2, 1)));
-  }
-
-  @Test
-  public void test3() {
-    nums = new int[] {1};
-    assertThat(solution1.largestDivisibleSubset(nums), is(Arrays.asList(1)));
-  }
-
-  @Test
-  public void test4() {
-    nums = new int[] {546, 669};
-    assertThat(solution1.largestDivisibleSubset(nums), is(Arrays.asList(546)));
-  }
-
-  @Test
-  public void test5() {
-    nums = new int[] {};
-    assertThat(solution1.largestDivisibleSubset(nums), is(Arrays.asList()));
-  }
-
-  @Test
-  public void test6() {
-    nums = new int[] {4, 8, 10, 240};
-    assertThat(solution1.largestDivisibleSubset(nums), is(Arrays.asList(240, 8, 4)));
-  }
+    private static _368.Solution1 solution1;
+    private static _368.Solution2 solution2;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _368.Solution1();
+        solution2 = new _368.Solution2();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{1, 2, 4, 8};
+        assertEquals(Arrays.asList(1, 2, 4, 8), solution1.largestDivisibleSubset(nums));
+        assertEquals(Arrays.asList(8, 4, 2, 1), solution2.largestDivisibleSubset(nums));
+    }
+
+    @Test
+    public void test2() {
+        nums = new int[]{1, 2, 3};
+        assertEquals(solution1.largestDivisibleSubset(nums), Arrays.asList(1, 2));
+        assertEquals(solution2.largestDivisibleSubset(nums), Arrays.asList(2, 1));
+    }
+
+    @Test
+    public void test3() {
+        nums = new int[]{1};
+        assertEquals(solution1.largestDivisibleSubset(nums), Arrays.asList(1));
+    }
+
+    @Test
+    public void test4() {
+        nums = new int[]{546, 669};
+        assertEquals(solution1.largestDivisibleSubset(nums), Arrays.asList(546));
+    }
+
+    @Test
+    public void test5() {
+        nums = new int[]{};
+        assertEquals(solution1.largestDivisibleSubset(nums), Arrays.asList());
+    }
+
+    @Test
+    public void test6() {
+        nums = new int[]{4, 8, 10, 240};
+        assertEquals(solution1.largestDivisibleSubset(nums), Arrays.asList(4, 8, 240));
+        assertEquals(solution2.largestDivisibleSubset(nums), Arrays.asList(240, 8, 4));
+    }
 }
