剑指 Offer16.数值的整数次方

剑指offer16.数值的整数次方

1.暴力法
class Solution {
public:
	double myPow(double x, int n) {
		double res = 1;
		if (n < 0) {
			x = 1 / x;
			n = -n;
		}
		for (int i = 0; i < n; ++i)
			res *= x;
		return res;
	}
};

2.二分法
class Solution {
public:
    double myPow(double x, int n) {
        if (!n) return 1;
        if (n < 0) n = -n, x = 1 / x;
        return n & 1 ? x * myPow(x * x, n >> 1) : myPow(x * x, n >> 1);
    }
};

3.迭代法
class Solution {
public:
    double myPow(double x, long n) {
        if (!n) return 1;
        if (n < 0) n = -n, x = 1 / x;
        double result = 1;
        while (n) {
            if (n & 1) result *= x;
            x *= x, n >>= 1;
        }
        return result;
    }
};