题目:https://leetcode-cn.com/problems/sqrtx/
答案:
二分查找:
public int mySqrt(int x) {
if(x == 1)
return 1;
int min = 0;
int max = x;
while(max-min>1)
{
int m = (max+min)/2;
if(x/m<m)
max = m;
else
min = m;
}
return min;
}
题目:https://leetcode-cn.com/problems/sqrtx/
答案:
二分查找:
public int mySqrt(int x) {
if(x == 1)
return 1;
int min = 0;
int max = x;
while(max-min>1)
{
int m = (max+min)/2;
if(x/m<m)
max = m;
else
min = m;
}
return min;
}