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
This repository was archived by the owner on Nov 25, 2022. It is now read-only.

Latest commit

 

History

History
History
43 lines (39 loc) · 1 KB
/

SearchInsertPosition.java

File metadata and controls

43 lines (39 loc) · 1 KB
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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
public class Algorithm_Day1_SearchInsertPosition {
public static int searchInsert(int[] nums, int target) {
int L = 0;
int H = nums.length-1;
int M;
if(nums[0]>target) {
return 0;
}
else if(nums[nums.length-1]<target) {
return nums.length;
}
else {
while (L<=H) {
M = L+(H-L)/2;
if(nums[M]==target) {
return M;
}
if(nums[M]>target) {
H=M-1;
if(nums[H]<target) {
return H+1;
}
}
else {
L=M+1;
if(nums[L]>target) {
return L;
}
}
}
}
return -1;
}
public static void main(String[] args) {
int [] a = {1};
int t = 0;
System.out.println(searchInsert(a,t));
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.