-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram62.java
More file actions
67 lines (41 loc) · 1.24 KB
/
program62.java
File metadata and controls
67 lines (41 loc) · 1.24 KB
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/*
35. Search Insert Position
Easy
13.2K
578
Companies
Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You must write an algorithm with O(log n) runtime complexity.
Example 1:
Input: nums = [1,3,5,6], target = 5
Output: 2
Example 2:
Input: nums = [1,3,5,6], target = 2
Output: 1
Example 3:
Input: nums = [1,3,5,6], target = 7
Output: 4
*/
package LeetCode;
public class program62 {
static int searchInsert(int[] nums, int target) {
int num =0;
int left = 0;
int right = nums.length-1;
while(left<right){
if(nums[left]==target){
return left;
}
if(nums[right]==target){
return right;
}
left++;
right--;
}
return num;
}
public static void main(String[] args) {
int[] nums = {1,3,5,6};
int target = 5;
}
}