不熟悉二分查找的
复习一下二分查找
二分查找详细分析
package suanfa.快慢指针;
public class binarySerach {
public static void main(String[] args) {
System.out.println(binarySerach(25));
}
public static int binarySerach(int x){
int index=-1;
int right=x;
int leaf=0;
while (leaf<=right){
int mid=leaf+(right-leaf)/2;
if (mid*mid<=x){
index=mid;
leaf=mid+1;
}
else {
right=mid-1;
}
}
return index;
}
}