Practice Pow(x, n)
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Implement pow(x, n), which calculates x raised to the power n (i.e., x^n).
Source: Pow(x, n) on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
x = 2.00000, n = 10
Output
1024.00000
# Example 2
Input
x = 2.10000, n = 3
Output
9.26100
# Example 3
Input
x = 2.00000, n = -2
Output
0.25000
Constraints
-100.0 < x < 100.0
-2^31 <= n <= 2^31-1
n is an integer.
Either x is not zero or n > 0.
-10^4 <= x^n <= 10^4
Related LeetCode Problems
Practice more problems similar to Pow(x, n).
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.