refactor 50

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_50.java

@@ -1,69 +1,54 @@
 package com.fishercoder.solutions;
 
-/**
- * 50. Pow(x, n)
- *
- * Implement pow(x, n).
-
- Example 1:
-
- Input: 2.00000, 10
- Output: 1024.00000
-
- Example 2:
-
- Input: 2.10000, 3
- Output: 9.26100
- */
 public class _50 {
 
-  public static class Solution1 {
-    /**
-     * Time: O(logn)
-     * Space: O(logn)
-     */
-    public double myPow(double x, int n) {
-      long N = n;
-      if (N < 0) {
-        x = 1 / x;
-        N = -N;
-      }
-      return fastPow(x, N);
-    }
+    public static class Solution1 {
+        /**
+         * Time: O(logn)
+         * Space: O(logn)
+         */
+        public double myPow(double x, int n) {
+            long N = n;
+            if (N < 0) {
+                x = 1 / x;
+                N = -N;
+            }
+            return fastPow(x, N);
+        }
 
-    private double fastPow(double x, long n) {
-      if (n == 0) {
-        return 1.0;
-      }
-      double half = fastPow(x, n / 2);
-      if (n % 2 == 0) {
-        return half * half;
-      } else {
-        return half * half * x;
-      }
+        private double fastPow(double x, long n) {
+            if (n == 0) {
+                return 1.0;
+            }
+            double half = fastPow(x, n / 2);
+            if (n % 2 == 0) {
+                return half * half;
+            } else {
+                return half * half * x;
+            }
+        }
     }
-  }
 
-  public static class Solution2 {
-    /**
-     * Time: O(logn)
-     * Space: O(1)
-     */
-    public double myPow(double x, int n) {
-      long N = n;
-      if (N < 0) {
-        x = 1 / x;
-        N = -N;
-      }
-      double answer = 1;
-      double currentProduct = x;
-      for (long i = N; i > 0; i /= 2) {
-        if (i % 2 == 1) {
-          answer = answer * currentProduct;
+    public static class Solution2 {
+        /**
+         * Time: O(logn)
+         * Space: O(1)
+         */
+        public double myPow(double x, int n) {
+            long N = n;
+            if (N < 0) {
+                x = 1 / x;
+                N = -N;
+            }
+            double answer = 1;
+            double currentProduct = x;
+            for (long i = N; i > 0; i /= 2) {
+                if (i % 2 == 1) {
+                    answer = answer * currentProduct;
+                }
+                currentProduct *= currentProduct;
+            }
+            return answer;
         }
-        currentProduct *= currentProduct;
-      }
-      return answer;
     }
-  }
 }