forked from rpj911/LeetCode_algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsearchInsert.java
More file actions
29 lines (24 loc) · 796 Bytes
/
searchInsert.java
File metadata and controls
29 lines (24 loc) · 796 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
package Algorithms.binarySearch;
public class searchInsert {
public static void main(String[] args) {
int[] A = {1,3,5,6};
int target = 0;
System.out.println(searchInsert(A, target));
}
public static int searchInsert(int[] A, int target) {
int low = 0, high = A.length-1;
int mid = low + (high-low)/2;
while(low <= high){
mid = low + (high-low)/2;
if(A[mid] == target){
return mid;
}else if(target > A[mid]){
low = mid+1;
}else{
high = mid-1;
}
}
// 返回下限值，此时刚好为适合插入的位置
return low;
}
}