Binary Search1
2
3
4
5
6
7
8
9
10
11
12
13
14class Solution {
private int binarySearch(int[] nums,int target,int l,int r){
while(l<=r){
int mid=l+(r-l)/2;
if(nums[mid]==target) return mid;
else if(nums[mid]<target) l=mid+1;
else r=mid-1;
}
return l;
}
public int searchInsert(int[] nums, int target) {
return binarySearch(nums,target,0,nums.length-1);
}
}