【LeetCode & 劍指offer刷題】分治法題1:16 數值的整數次方(50. Pow(x, n))
阿新 • • 發佈:2019-01-06
【LeetCode & 劍指offer 刷題筆記】目錄(持續更新中...)
50. Pow(x, n)
Implement pow( x , n ) , which calculates x raised to the power n (x n ). Example 1: Input: 2.00000, 10 Output:-
-100.0 <
- n is a 32-bit signed integer, within the range [−2 31 , 2 31 − 1]