Leetcode 31. Pow(x, n) 解题报告

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/isunbin/article/details/88069157

class Solution {
    public:
    double myPow(double x, int n) 
    {
        double res = 1.0;
        for(int i = n; i != 0; i /= 2)
        {
            if(i % 2 != 0)
                res *= x;
            x *= x;
        }
        return  n < 0 ? 1 / res : res;
    }
};