二分查找适用于有序的数组
public static int binarySearch(int[] binary, final int target) {
int left = 0, right = binary.length - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (target < binary[mid]) {
right = mid - 1;
} else if (target == binary[mid]) {
return mid;
} else {
left = mid + 1;
}
}
return -1;
}