Fast power
Mediummathrecursiondivide and conquer
Compute x to the power n without the built-in power function. n may be negative. Aim for O(log |n|).
Example 1
Input: x = 2, n = 10 Output: 1024
Example 2
Input: x = 2, n = -2 Output: 0.25
1 / 2² = 0.25.
Constraints
- -100 < x < 100
- -2³¹ ≤ n ≤ 2³¹ - 1
- x ≠ 0 or n > 0
- -10⁴ ≤ result ≤ 10⁴
Submit checks your solution against 9 tests, including hidden ones.
/**
* @param {double} x
* @param {int} n
* @return {double}
*/
function myPow(x, n) {
}