官方代码答案:作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/search-insert-position/solution/sou-suo-cha-ru-wei-zhi-by-leetcode-solution/
来源:力扣(LeetCode)
二分法还真是花样多啊...这个mid真的秀。
个人微改:
import java.util.Scanner;
public class searchInsertPosition {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
System.out.println("please enter the capcity of your array :");
int m = sc.nextInt();
System.out.println("please enter your array of integers :");
int a[] = new int[m];
for(int i=0;i<m;i++) {
a[i]=sc.nextInt();
}
System.out.println("please enter your target :");
int n = sc.nextInt();
n=findBinary(a,n);
System.out.println("the result is :"+n);
sc.close();
}
static int findBinary(int nums[],int target) {
int left=0,right=nums.length-1,ans=nums.length;
while(left<=right) {
int mid=((right-left)>>1)+left;
if(nums[mid]>=target) {
ans=mid;
right=mid-1;
}else {
left=mid+1;
}
}
return ans;
}
}