手写二分查找
private int binarySearch(int []nums, int left, int right, int value) {
if(left > right) {
return -1;
}
int mid = (left+right)/2;
int midValue = nums[mid];
if(value > midValue) {
return binarySearch(nums, mid+1, right, value);
} else (value < minValue) {
return binarySearch(nums, left, mind-1, value);
} else {
return mid;
}
}