Pow(x, n)

Posted tianzeng

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Pow(x, n)相关的知识,希望对你有一定的参考价值。

Implement pow(xn), which calculates x raised to the power n (xn).

Example 1:

Input: 2.00000, 10
Output: 1024.00000

Example 2:

Input: 2.10000, 3
Output: 9.26100

Example 3:

Input: 2.00000, -2
Output: 0.25000
Explanation: 2-2 = 1/22 = 1/4 = 0.25

Note:

  • -100.0 < x < 100.0
  • n is a 32-bit signed integer, within the range [−231, 231 − 1]
#include <iostream>
#include <cmath>
using namespace std;

class Solution
{
public:
    double myPow(double x, int n)
    {
        if(abs(x-0)<0.000001)
            return 0;
        if(n==-1)
            return 1.0/x;
        else if(n==1)
            return x;
        else if(n==0)
            return 1;

        double res=myPow(x,n/2);
        res*=res;
        if(n!=n/2*2)//odd or even
        {
            if(n>0)
                return res*x;
            else
                return res/x;
        }
        else
        {
            return res;
        }
    }
};


int main()
{
    Solution s;
    cout<<s.myPow(2.0000,-10)<<endl;
    return 0;
}

 

以上是关于Pow(x, n)的主要内容,如果未能解决你的问题,请参考以下文章

[leetcode] Pow(x, n)

leetcode笔记:Pow(x, n)

leetcode50Pow(x,n)

LeetCode50. Pow(x, n)(快速幂)

LeetCode50. Pow(x, n)(快速幂)

[LeetCode] 50. Pow(x, n) Java