Leetcode 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 Solution {
    public double MyPow(double x, int n) {
        if (n == 0) return 1;
        if (n == 1) return x;
        if (n == -1) return 1 / x;
        
        int left = n / 2;
        int right = n - left;
        
        if (left == right)
        {
            var l = MyPow(x, left);
            return l * l;
        }
        else
        {
            return MyPow(x, left) * MyPow(x, right);
        }
    }
}