主函数的套路
import java.io.*;
public class Main{
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] s1 = br.readLine().split(" ");
int n = Integer.parseInt(s1[0]);
String[] s2 = br.readLine().split(" ");
int[] arr = new int[n];
for(int i = 0; i < n; i ++) arr[i] = Integer.parseInt(s2[i]);
int target = Integer.parseInt(br.readLine());
int res = binarySearch(arr,target);
System.out.println(res);
br.close();
}
1.某一个数的索引
给定一个 n 个元素有序的(升序)整型数组 nums 和一个目标值 target ,写一个函数搜索 nums 中的 target,如果目标值存在返回下标,否则返回 -1。假设 nums 中的所有元素是不重复的。
示例:
输入: nums = [-1,0,3,5,9,12], target = 9
输出: 4
解释: 9 出现在 nums 中并且下标为 4
public static int binarySearch(int[] nums, int target){
int l = 0;
int r = nums.length - 1;
while(l < r){
int mid = (l + r) >> 1;
if(nums[mid] >= target) {r = mid;}
else{
l = mid + 1;
}
}
if(nums[l] != target) return -1;
else {return l;}
}
2.最后一个小于目标值target的数的索引
示例 1:
输入: nums = [1,3,3,5,6], target = 3
输出: 0示例 2:
输入: nums = [1,3,3,5,6], target = 4
输出: 2示例3:
输入: nums = [1,3,3,5,6], target = 1
输出: -1
public static int binarySearch(int[] nums, int target){
int l = 0;
int r = nums.length - 1;
//越界判断
if(nums[l] >= target){
return -1;
}
while(l < r){
int mid = (l + r + 1) >> 1;
if(nums[mid] < target) {l = mid;}
else{r = mid - 1;}
}
return l;
}
3.最后一个小于等于目标值target的数的索引
示例 1:
输入: nums = [1,3,3,5,6], target = 3
输出: 2示例 2:
输入: nums = [1,3,3,5,6], target = 4
输出: 2示例3:
输入: nums = [1,3,3,5,6], target = 0
输出: -1
public static int binarySearch(int[] nums, int target){
int l = 0;
int r = nums.length - 1;
//越界判断
if(nums[l] > target){
return -1;
}
while(l < r){
int mid = (l + r + 1) >> 1;
if(nums[mid] <= target) {l = mid;}
else{r = mid - 1;}
}
return l;
}
4.第一个大于目标值target的数的索引
示例 1:
输入: nums = [1,3,3,5,6], target = 3
输出: 3示例 2:
输入: nums = [1,3,3,5,6], target = 2
输出: 1示例3:
输入: nums = [1,3,3,5,6], target = 6
输出: -1
public static int binarySearch(int[] nums, int target){
int l = 0;
int r = nums.length - 1;
//越界判断
if(nums[r] <= target){
return -1;
}
while(l < r){
int mid = (l + r ) >> 1;
if(nums[mid] > target) {r = mid;}
else{l = mid + 1;}
}
return l;
}
5.第一个大于等于目标值target的数的索引
示例 1:
输入: nums = [1,3,3,5,6], target = 3
输出: 1示例 2:
输入: nums = [1,3,3,5,6], target = 4
输出: 3示例3:
输入: nums = [1,3,3,5,6], target = 8
输出: -1
public static int binarySearch(int[] nums, int target){
int l = 0;
int r = nums.length - 1;
//越界判断
if(nums[r] < target){
return -1;
}
while(l < r){
int mid = (l + r ) >> 1;
if(nums[mid] >= target) {r = mid;}
else{l = mid + 1;}
}
return l;
}