50. Pow(x, n)

Implement pow(x, n), which calculates x raised to the power n (xn).

Example 1:

Input: 2.00000, 10
Output: 1024.00000
Example 2:

Input: 2.10000, 3
Output: 9.26100
Example 3:

Input: 2.00000, -2
Output: 0.25000
Explanation: 2-2 = 1/22 = 1/4 = 0.25
Note:

-100.0 < x < 100.0
n is a 32-bit signed integer, within the range [−231, 231 − 1]
Seen this question in a real interview before?  No
Thanks for your feedback.
Difficulty:Medium
Total Accepted:238.2K
Total Submissions:899.1K
Contributor:LeetCode
Subscribe to see which companies asked this question.

Related Topics 
MathBinary Search
Similar Questions 
Sqrt(x)Super Pow
Java	





 public double myPow(double x, int n) {
        if (n == 1) {
            return x;
        }
        if (n % 2 != 0) {
            double result = myPow(x, n / 2);
            return  result*result*x;
        }else {
            double result = myPow(x, n / 2);
            return  result*result;
        }

    }
1
class Solution {
2
    public double pow(double x, int n) {
3
        if (n == 1) {
4
            return x;
5
        }
6
        if (n == 0) {
7
            return 1;
8
        }
9
        if (n % 2 != 0) {
10
            double result = pow(x, n / 2);
11
            return result * result * x;
12
        } else {
13
            double result = pow(x, n / 2);
14
            return result * result;
15
        }
16
​
17
    }
18
​
19
    public double myPow(double x, int n) {
20
        double pow = pow(x, n);
21
        if (n < 0) {
22
            return 1.0 / pow;
23
        } else {
24
            return pow;
25
        }
26
​
27
    }
28
​
29
}
  Custom Testcase( Contri