pow(x,n) leetcod c++

最新推荐文章于 2024-05-15 08:51:21 发布

wishingweed

最新推荐文章于 2024-05-15 08:51:21 发布

阅读量402

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u010484308/article/details/41219631

版权

leetcode 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

for this problem, I learned a new method called fast mean. please see it in details.

class Solution {
public:
    double pow(double x, int n) {
        if(n == 0)
            return 1.0;
        if(n<0)
        {
            if(n == INT_MIN)
                return 1.0/pow(x,INT_MAX)*x;
            else
                return 1.0/pow(x,-n);
        }
        double ans = 1.0;
        for(;n>0;x = x*x,n = n>>1)
        {
            if(n&1 == 1) ans = ans*x;

        }
        return ans;
    }
};