50.powx-n

[hey-monster]

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]

来源：力扣（LeetCode） 链接：https://leetcode-cn.com/problems/powx-n 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

思路一：

[hey-monster]

不好意思了，没注意把原来的issue内容给改掉了

[tejas702]

@hey-monster I would like to work on this.