0050-powx-n.adoc

50. Pow(x, n)

LeetCode - Pow(x, n)

首先，可以把"一半的计算结果"存储起来，节省一半的递归调用；

其次，没想到还需要处理"无穷"的情况！

另外，思考一下，如果使用迭代来实现？

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

link:{sourcedir}/_0050_PowXN.java[role=include]