LeetCode | 50. Pow(x, n)

最新推荐文章于 2024-11-10 14:06:08 发布

1LOVESJohnny

最新推荐文章于 2024-11-10 14:06:08 发布

阅读量163

点赞数

分类专栏： LeetCode 文章标签： Leetcode leetcode

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/97964194

版权

LeetCode 专栏收录该内容

285 篇文章 0 订阅

订阅专栏

题目：

Implement pow(x, n), 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]

代码：

class Solution {
public:
    double PowN(double x, long long n) {
		if (n == 1)
			return x;
		if (n == 2)
			return x * x;
		double x2 = PowN(x, n / 2);
		if (n % 2)
			return x * x2 * x2;
		return x2 * x2;
	}
	double myPow(double x, int n) {
		if (n == 0)
			return 1.0;
		if (x == 0.0 || x == 1.0)
			return x;
        long long nn = n;
		if (nn < 0)
		{
			nn = -nn;
			x = 1.0 / x;
		}
		return PowN(x, nn);
	}
};