refactor 264

fishercoder1534 · fishercoder1534 · commit 03ef9b72e910 · 2018-11-08T07:38:20.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_264.java b/src/main/java/com/fishercoder/solutions/_264.java
@@ -11,30 +11,33 @@
  */
 public class _264 {
 
-    /**credit: https://discuss.leetcode.com/topic/21791/o-n-java-solution*/
-    public int nthUglyNumber(int n) {
-        int[] ugly = new int[n];
-        ugly[0] = 1;
-        int index2 = 0;
-        int index3 = 0;
-        int index5 = 0;
-        int factor2 = 2;
-        int factor3 = 3;
-        int factor5 = 5;
-        for (int i = 1; i < n; i++) {
-            int min = Math.min(Math.min(factor2, factor3), factor5);
-            ugly[i] = min;
-            if (factor2 == min) {
-                factor2 = 2 * ugly[++index2];
-            }
-            if (factor3 == min) {
-                factor3 = 3 * ugly[++index3];
-            }
-            if (factor5 == min) {
-                factor5 = 5 * ugly[++index5];
+    public static class Solution1 {
+        /**
+         * credit: https://discuss.leetcode.com/topic/21791/o-n-java-solution
+         */
+        public int nthUglyNumber(int n) {
+            int[] ugly = new int[n];
+            ugly[0] = 1;
+            int index2 = 0;
+            int index3 = 0;
+            int index5 = 0;
+            int factor2 = 2;
+            int factor3 = 3;
+            int factor5 = 5;
+            for (int i = 1; i < n; i++) {
+                int min = Math.min(Math.min(factor2, factor3), factor5);
+                ugly[i] = min;
+                if (factor2 == min) {
+                    factor2 = 2 * ugly[++index2];
+                }
+                if (factor3 == min) {
+                    factor3 = 3 * ugly[++index3];
+                }
+                if (factor5 == min) {
+                    factor5 = 5 * ugly[++index5];
+                }
             }
+            return ugly[n - 1];
         }
-        return ugly[n - 1];
     }
-
 }
diff --git a/src/test/java/com/fishercoder/_264Test.java b/src/test/java/com/fishercoder/_264Test.java
@@ -6,24 +6,21 @@
 
 import static org.junit.Assert.assertEquals;
 
-/**
- * Created by stevesun on 6/7/17.
- */
 public class _264Test {
-    private static _264 test;
+    private static _264.Solution1 solution1;
 
     @BeforeClass
     public static void setup() {
-        test = new _264();
+        solution1 = new _264.Solution1();
     }
 
     @Test
     public void test1() {
-        assertEquals(12, test.nthUglyNumber(10));
+        assertEquals(12, solution1.nthUglyNumber(10));
     }
 
     @Test
     public void test2() {
-        assertEquals(402653184, test.nthUglyNumber(1352));
+        assertEquals(402653184, solution1.nthUglyNumber(1352));
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -6,24 +6,21 @@`
`6`	`6`
`7`	`7`	`import static org.junit.Assert.assertEquals;`
`8`	`8`
`9`		`-/**`
`10`		`- * Created by stevesun on 6/7/17.`
`11`		`- */`
`12`	`9`	`public class _264Test {`
`13`		`- private static _264 test;`
	`10`	`+ private static _264.Solution1 solution1;`
`14`	`11`
`15`	`12`	`@BeforeClass`
`16`	`13`	`public static void setup() {`
`17`		`- test = new _264();`
	`14`	`+ solution1 = new _264.Solution1();`
`18`	`15`	`}`
`19`	`16`
`20`	`17`	`@Test`
`21`	`18`	`public void test1() {`
`22`		`- assertEquals(12, test.nthUglyNumber(10));`
	`19`	`+ assertEquals(12, solution1.nthUglyNumber(10));`
`23`	`20`	`}`
`24`	`21`
`25`	`22`	`@Test`
`26`	`23`	`public void test2() {`
`27`		`- assertEquals(402653184, test.nthUglyNumber(1352));`
	`24`	`+ assertEquals(402653184, solution1.nthUglyNumber(1352));`
`28`	`25`	`}`
`29`	`26`	`}`