FWNX-C++ version - power

Consider the binary representation of n. For example, if it is "10001011", then x^n = x^(1+2+8+128) = x^1 * x^2 * x^8 * x^128. Thus, we don't want to loop n times to calculate x^n. To speed up, we loop through each bit, if the i-th bit is 1, then we add x^(1 << i) to the result. Since (1 << i) is a power of 2, x^(1<<(i+1)) = square(x^(1<<i)). The loop executes for a maximum of log(n) times.

class Solution {
public:
    double pow(double x, int n) {
        unsigned m = abs((double)n);
        double ret = 1;
        for ( ; m; x *= x, m >>= 1) {
            if (m & 1) {
                ret *= x;
            }
        }
        return (n < 0) ? (1.0 / ret) : (ret);
    }
};

once the last bit of n is 1 we should make it up

 "10001011", then x^n = x^(1+2+8+128) = x^1 * x^2 * x^8 * x^128

1 is the signal to multiple different power of x;

x*=x ; means to calculate the x^n

we calculate all of the possible number of x ;

x^0 x^1 x^2 …… x^31;

负数没啥 就是 set the highest as 1 and then 取反加一 后面的··· 就是这个数的绝对值了··

my solution:

class Solution {
public:
    double pow(double x, int n) {
        
    unsigned m = n >= 0 ? n : -n;
	double ret =1;
	for (; m; m >>= 1)
	{
		if (m & 1 == 1)
		{
			ret *= x;
		}
		
			x *= x;			  //every time we calculate it here;
		//	cout << base << " -> ";
	}				
	return n>0?ret : 1/ret;
	
    }
};