[N-0] refactor 50

Author: fishercoder1534

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

@@ -1,25 +1,39 @@
 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 double myPow(double x, int n) {
-        if (n == 0) {
-            return 1;
-        }
-        if (n == Integer.MIN_VALUE) {
-            ++n;
-            n = -n;
-            x = 1 / x;
-            return x * x * myPow(x * x, n / 2);
-        }
-        if (n < 0) {
-            n = -n;
-            x = 1 / x;
+    public static class Solution1 {
+        public double myPow(double x, int n) {
+            if (n == 0) {
+                return 1;
+            }
+            if (n == Integer.MIN_VALUE) {
+                ++n;
+                n = -n;
+                x = 1 / x;
+                return x * x * myPow(x * x, n / 2);
+            }
+            if (n < 0) {
+                n = -n;
+                x = 1 / x;
+            }
+            return (n % 2 == 0) ? myPow(x * x, n / 2) : x * myPow(x * x, n / 2);
         }
-        return (n % 2 == 0) ? myPow(x * x, n / 2) : x * myPow(x * x, n / 2);
     }
 
 }