求一个数的平方根,答案是利用二叉搜索树写的,代码如下:
public class Solution {
public int mySqrt(int x) {
if(x==0) return 0;
int left=1,right=Integer.MAX_VALUE;
while(true){
int mid=left+(right-left)/2;
if(mid>x/mid)
right=mid-1;
else{
if(mid+1>x/(mid+1))
return mid;
left=mid+1;
}
}
}
}