-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram65.java
More file actions
61 lines (40 loc) · 1.16 KB
/
program65.java
File metadata and controls
61 lines (40 loc) · 1.16 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
/*
35. Search Insert Position
Easy
13.3K
580
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 program65 {
static int searchInsert(int[] nums, int target) {
for(int i=0;i<nums.length;i++){
if(nums[i]==target){
return i;
}
if(nums[i]>target){
return i;
}
if(i==nums.length-1){
return i+1;
}
}
return -1;
}
public static void main(String[] args) {
int nums[] = {1,3,5,6};
int target = 5;
System.out.println(searchInsert(nums, target));
}
}