Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
29 lines (24 loc) · 796 Bytes

File metadata and controls

29 lines (24 loc) · 796 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.