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
30 lines (26 loc) · 651 Bytes

File metadata and controls

30 lines (26 loc) · 651 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
30
package leetcode.binarySearch;
public class leetcode35 {
public static void main(String[] args) {
new leetcode35().searchInsert(
new int[]{
1,2,3,5
},4
);
}
public int searchInsert(int[] nums, int target) {
int result=0;
int head=0;
int tail=nums.length-1;
while(head<=tail){
int md=(head+tail)/2;
if(nums[md]==target){
return md;
}else if(nums[md]<target){
head=md+1;
}else{
tail=md-1;
}
}
return head;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.