利用二分搜索, 从1到x搜索
if(x<=1) {
return x;
}
int begin = 1;
int end = x;
int middle = 0;
while(begin<=end) {
middle = begin + (end - begin)/2;
//不要写成middle*middle==x,会溢出
if(middle==x/middle) {
return middle;
} else {
if (middle<x/middle) {
begin = middle + 1;
} else {
end = middle - 1;
}
}
}
//结束条件end一定<begin,所以返回end
return end;