public int mySqrt(int x) {
int high = x;
int low = 1;
int mid = (high+low)/2;
while (low<=high)
{
if (mid == x/ mid)
{
return mid;
}
else if(mid>x/mid)
{
high = mid -1;
}
else {
low =mid + 1;
}
mid = (high+low)/2;
}
return mid;
}
}
leetcode69 java 二分法应用
最新推荐文章于 2022-03-13 00:00:00 发布