refactor 440

fishercoder1534 · fishercoder1534 · commit ca4b5a386921 · 2019-04-02T08:04:06.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_440.java b/src/main/java/com/fishercoder/solutions/_440.java
@@ -20,32 +20,35 @@
  */
 public class _440 {
 
-    /**credit: https://discuss.leetcode.com/topic/64624/concise-easy-to-understand-java-5ms-solution-with-explaination/2*/
-    public int findKthNumber(int n, int k) {
-        int curr = 1;
-        k = k - 1;
-        while (k > 0) {
-            int steps = calSteps(n, curr, curr + 1);
-            if (steps <= k) {
-                curr += 1;
-                k -= steps;
-            } else {
-                curr *= 10;
-                k -= 1;
+    public static class Solution1 {
+        /**
+         * credit: https://discuss.leetcode.com/topic/64624/concise-easy-to-understand-java-5ms-solution-with-explaination/2
+         */
+        public int findKthNumber(int n, int k) {
+            int curr = 1;
+            k = k - 1;
+            while (k > 0) {
+                int steps = calSteps(n, curr, curr + 1);
+                if (steps <= k) {
+                    curr += 1;
+                    k -= steps;
+                } else {
+                    curr *= 10;
+                    k -= 1;
+                }
             }
+            return curr;
         }
-        return curr;
-    }
 
-    //use long in case of overflow
-    public int calSteps(int n, long n1, long n2) {
-        int steps = 0;
-        while (n1 <= n) {
-            steps += Math.min(n + 1, n2) - n1;
-            n1 *= 10;
-            n2 *= 10;
+        //use long in case of overflow
+        public int calSteps(int n, long n1, long n2) {
+            int steps = 0;
+            while (n1 <= n) {
+                steps += Math.min(n + 1, n2) - n1;
+                n1 *= 10;
+                n2 *= 10;
+            }
+            return steps;
         }
-        return steps;
     }
-
 }
