The Wayback Machine - https://web.archive.org/web/20210125134024/https://github.com/grandyang/leetcode/issues/2006
Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

50.powx-n #2006

Open
hey-monster opened this issue Feb 4, 2020 · 1 comment
Open

50.powx-n #2006

hey-monster opened this issue Feb 4, 2020 · 1 comment

Comments

@hey-monster
Copy link

@hey-monster hey-monster commented Feb 4, 2020

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 hey-monster closed this Feb 4, 2020
@hey-monster hey-monster reopened this Feb 4, 2020
@hey-monster hey-monster changed the title 0050.powx-n 50.powx-n Feb 4, 2020
@hey-monster
Copy link
Author

@hey-monster hey-monster commented Feb 4, 2020

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

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Linked pull requests

Successfully merging a pull request may close this issue.

None yet
1 participant