private int binSearch(String[] srcArray, String key) {
int start = 0;
int end = srcArray.length - 1;
int middle = (end - start) / 2;
int findvalue=Integer.parseInt(key);
while (start <= end) {
int midvalue=Integer.parseInt(srcArray[middle]);
if(findvalue==midvalue){
//如果等于中间值
return middle;
}else if(findvalue<midvalue){
//小于中值时在中值前面找
middle=middle-1;
end=middle;
}else{
//大于中值在中值后面找
middle=middle+1;
start=middle;
}
}
return -1;
}
int start = 0;
int end = srcArray.length - 1;
int middle = (end - start) / 2;
int findvalue=Integer.parseInt(key);
while (start <= end) {
int midvalue=Integer.parseInt(srcArray[middle]);
if(findvalue==midvalue){
//如果等于中间值
return middle;
}else if(findvalue<midvalue){
//小于中值时在中值前面找
middle=middle-1;
end=middle;
}else{
//大于中值在中值后面找
middle=middle+1;
start=middle;
}
}
return -1;
}