LeetCode --- 50. Pow(x, n)

最新推荐文章于 2024-01-14 14:45:28 发布

MissXy_

最新推荐文章于 2024-01-14 14:45:28 发布

阅读量227

点赞数

分类专栏： LeetCode 文章标签： 50. Pow(x n) Pow(x n)

本文链接：https://blog.csdn.net/MissXy_/article/details/89481436

版权

LeetCode 专栏收录该内容

55 篇文章 0 订阅

订阅专栏

50. Pow(x, n)

Difficulty: Medium

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

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 [−2³¹, 2³¹− 1]

Solution

思路1

递归解决，其中n<0情况一开始return 1/myPow(x, -n)发现边界溢出，后来参照这个博客找到解决方案，代码如下：
Language: C++

class Solution {
public:
    double myPow(double x, int n) {
        if (n == 0)
            return 1;
        if (n < 0)
            return 1/x * myPow(1/x, -(n+1));
        if (n % 2)
            return x * myPow(x, n-1);
        return myPow(x*x, n/2);
    }
};