二分查找法
/**
*
* @author 清风半夜鸣蛙
* csdn:https://blog.youkuaiyun.com/H2677lucy?spm=1000.2115.3001.5343
*/
public class BinarySearch {
private static int binarySearch(int[] data,int start,int end,int key) {
if(start > end) {
return -1;
}
while(start &
原创
2021-01-27 15:59:31 ·
157 阅读 ·
0 评论