refactor 368

fishercoder1534 · fishercoder1534 · commit fbf59c425166 · 2019-02-06T09:31:08.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_368.java b/src/main/java/com/fishercoder/solutions/_368.java
@@ -24,36 +24,38 @@
  */
 public class _368 {
 
-    /**Credit: https://discuss.leetcode.com/topic/49652/classic-dp-solution-similar-to-lis-o-n-2*/
-    public List<Integer> largestDivisibleSubset(int[] nums) {
-        int len = nums.length;
-        int[] count = new int[len];
-        int[] pre = new int[len];
-        Arrays.sort(nums);
-        int max = 0;
-        int index = -1;
-        for (int i = 0; i < len; i++) {
-            count[i] = 1;
-            pre[i] = -1;
-            for (int j = i - 1; j >= 0; j--) {
-                if (nums[i] % nums[j] == 0) {
-                    if (1 + count[j] > count[i]) {
-                        count[i] = count[j] + 1;
-                        pre[i] = j;
+    public static class Solution1 {
+        /** Credit: https://discuss.leetcode.com/topic/49652/classic-dp-solution-similar-to-lis-o-n-2 */
+        public List<Integer> largestDivisibleSubset(int[] nums) {
+            int len = nums.length;
+            int[] count = new int[len];
+            int[] pre = new int[len];
+            Arrays.sort(nums);
+            int max = 0;
+            int index = -1;
+            for (int i = 0; i < len; i++) {
+                count[i] = 1;
+                pre[i] = -1;
+                for (int j = i - 1; j >= 0; j--) {
+                    if (nums[i] % nums[j] == 0) {
+                        if (1 + count[j] > count[i]) {
+                            count[i] = count[j] + 1;
+                            pre[i] = j;
+                        }
                     }
                 }
+                if (count[i] > max) {
+                    max = count[i];
+                    index = i;
+                }
             }
-            if (count[i] > max) {
-                max = count[i];
-                index = i;
+            List<Integer> res = new ArrayList<>();
+            while (index != -1) {
+                res.add(nums[index]);
+                index = pre[index];
             }
+            return res;
         }
-        List<Integer> res = new ArrayList<>();
-        while (index != -1) {
-            res.add(nums[index]);
-            index = pre[index];
-        }
-        return res;
     }
 
 }
diff --git a/src/test/java/com/fishercoder/_368Test.java b/src/test/java/com/fishercoder/_368Test.java
@@ -9,51 +9,48 @@
 import static org.hamcrest.core.Is.is;
 import static org.junit.Assert.assertThat;
 
-/**
- * Created by fishercoder on 5/28/17.
- */
 public class _368Test {
-    private static _368 test;
-    private static int[] nums;
-
-    @BeforeClass
-    public static void setup() {
-        test = new _368();
-    }
-
-    @Test
-    public void test1() {
-        nums = new int[]{1, 2, 4, 8};
-        assertThat(test.largestDivisibleSubset(nums), is(Arrays.asList(8, 4, 2, 1)));
-    }
-
-    @Test
-    public void test2() {
-        nums = new int[]{1, 2, 3};
-        assertThat(test.largestDivisibleSubset(nums), is(Arrays.asList(2, 1)));
-    }
-
-    @Test
-    public void test3() {
-        nums = new int[]{1};
-        assertThat(test.largestDivisibleSubset(nums), is(Arrays.asList(1)));
-    }
-
-    @Test
-    public void test4() {
-        nums = new int[]{546, 669};
-        assertThat(test.largestDivisibleSubset(nums), is(Arrays.asList(546)));
-    }
-
-    @Test
-    public void test5() {
-        nums = new int[]{};
-        assertThat(test.largestDivisibleSubset(nums), is(Arrays.asList()));
-    }
-
-    @Test
-    public void test6() {
-        nums = new int[]{4, 8, 10, 240};
-        assertThat(test.largestDivisibleSubset(nums), is(Arrays.asList(240, 8, 4)));
-    }
+  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)));
+  }
 }
