leetcode每日一题——69
public static int  mySqrt(int  x){
if(x<=0)return&nbsp;0;
int&nbsp;low=1,high=x;
while&nbsp;(low<=high)&nbsp;{
long&nbsp;mid=(high-low)/2+low;
if&nbsp;(mid*mid==x)&nbsp;{
return&nbsp;(int)mid;
}else&nbsp;if(mid*mid<x)&nbsp;{
low=(int)mid+1;
}else&nbsp;{
high=(int)mid-1;
}
}
if&nbsp;(high*high<x)&nbsp;{
return&nbsp;(int)high;
}else&nbsp;{
return&nbsp;(int)low;
}
}
}