[Leetcode] #50 Pow(x, n)

Discription:

Implement pow(x, n).

Solution:

double myPow(double x, int n) {if (n == 0) return 1.0;if (n < 0){if (n == INT_MIN)return 1.0 / (myPow(x, INT_MAX)*x);elsereturn 1.0 / myPow(x, -1 * n);}double temp = myPow(x, n >> 1);if (n & 1 == 1)return x*temp*temp;else return temp*temp;}