二分查找模板
int binarySearch(int[] nums, int target) { int left = 0; int right = nums.length - 1; // 注意 while(left <= right) { // 注意 int mid = lift + (right - left) / 2; if(nums[mid] == target) return mid; else if





