Leetcode Pow (x, N) (Math, Binary Search) (*)

translation

实现pow(x, n).

Original

pow(x, n).

Analysis

First of all, we recommend Wikipedia:

zh.wikipedia.org/wiki/two Yuan search tree

En.wikipedia.org/wiki/binary_search_tree

Second, you can also look at a similar question:

Leetcode Sqrt (x) (Math, Binary Search) (*)

However, I still did not solve the problem, look at other people's solution ...

Class Solution {Private:Double Mypowhelper(DoubleXLong Long intN) {if(n==0)return 1;Else if(n==1)returnXElse if(n%2==0)        {Doubletemp = MYPOW (x, n/2);returnTemp*temp; }Else{DoubleTemp=mypow (x, (n1)/2);returnTemp*temp*x; }    } Public:Double Mypow(DoubleXintN) {Long Long intN = (Long Long intNif(n>=0)returnMypowhelper (x, N);Else            returnMypowhelper ((1.0/x),-N); }};

Pay tribute to the person who wrote the code ...

Leetcode Pow (x, N) (Math, Binary Search) (*)