refactor 553

fishercoder1534 · fishercoder1534 · commit 1dbc03fd40ec · 2019-06-27T07:23:56.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_553.java b/src/main/java/com/fishercoder/solutions/_553.java
@@ -31,31 +31,34 @@
  There is only one optimal division for each test case.
  */
 public class _553 {
+    public static class Solution1 {
+        /**
+         * Credit: https://github.com/lydxlx1/LeetCode/blob/master/src/_553.java
+         */
+        public String optimalDivision(int[] nums) {
+            /**https://docs.oracle.com/javase/8/docs/api/java/util/StringJoiner.html:
+             * StringJoiner is used to construct a sequence of characters separated by a delimiter and optionally starting with a supplied prefix and ending with a supplied suffix.
+             * The String "[George:Sally:Fred]" may be constructed as follows:
+             StringJoiner sj = new StringJoiner(":", "[", "]");
+             sj.add("George").add("Sally").add("Fred");
+             String desiredString = sj.toString();*/
 
-    /**Credit: https://github.com/lydxlx1/LeetCode/blob/master/src/_553.java*/
-    public String optimalDivision(int[] nums) {
-        /**https://docs.oracle.com/javase/8/docs/api/java/util/StringJoiner.html:
-         * StringJoiner is used to construct a sequence of characters separated by a delimiter and optionally starting with a supplied prefix and ending with a supplied suffix.
-         * The String "[George:Sally:Fred]" may be constructed as follows:
-         StringJoiner sj = new StringJoiner(":", "[", "]");
-         sj.add("George").add("Sally").add("Fred");
-         String desiredString = sj.toString();*/
-
-        if (nums.length == 1) {
-            return "" + nums[0];
-        }
-        if (nums.length == 2) {
-            return nums[0] + "/" + nums[1];
-        }
+            if (nums.length == 1) {
+                return "" + nums[0];
+            }
+            if (nums.length == 2) {
+                return nums[0] + "/" + nums[1];
+            }
 
-        /**Tricky one: the solution is fixed: always wrap the one from the second until the last.
-         * Another important thing to note that such way could work is that:
-         * the prerequisite is: Elements will be in range [2,1000], so no elements are smaller than 1.*/
-        StringJoiner stringJoiner = new StringJoiner("/");
-        for (int i = 1; i < nums.length; i++) {
-            stringJoiner.add("" + nums[i]);
+            /**Tricky one: the solution is fixed: always wrap the one from the second until the last.
+             * Another important thing to note that such way could work is that:
+             * the prerequisite is: Elements will be in range [2,1000], so no elements are smaller than 1.*/
+            StringJoiner stringJoiner = new StringJoiner("/");
+            for (int i = 1; i < nums.length; i++) {
+                stringJoiner.add("" + nums[i]);
+            }
+            return String.format("%d/(%s)", nums[0], stringJoiner.toString());
         }
-        return String.format("%d/(%s)", nums[0], stringJoiner.toString());
     }
 
 }
diff --git a/src/test/java/com/fishercoder/_553Test.java b/src/test/java/com/fishercoder/_553Test.java
@@ -10,23 +10,23 @@
  * Created by fishercoder on 5/25/17.
  */
 public class _553Test {
-    private static _553 test;
+    private static _553.Solution1 solution1;
     private static int[] nums;
 
     @BeforeClass
     public static void setup() {
-        test = new _553();
+        solution1 = new _553.Solution1();
     }
 
     @Test
     public void test1() {
         nums = new int[]{1000, 100, 10, 2};
-        assertEquals("1000/(100/10/2)", test.optimalDivision(nums));
+        assertEquals("1000/(100/10/2)", solution1.optimalDivision(nums));
     }
 
     @Test
     public void test2() {
         nums = new int[]{1000, 100, 40, 10, 2};
-        assertEquals("1000/(100/40/10/2)", test.optimalDivision(nums));
+        assertEquals("1000/(100/40/10/2)", solution1.optimalDivision(nums));
     }
 }
