-
Notifications
You must be signed in to change notification settings - Fork 0
/
SearchInsertPosition.java
55 lines (36 loc) · 1.06 KB
/
SearchInsertPosition.java
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
// https://leetcode.com/problems/search-insert-position/
public class SearchInsertPosition {
public static void main (String [] args) {
}
public static int searchInsert(int[] nums, int target) {
int resultado = 0;
int repuesta = existeEnArray(nums, target);
if ( repuesta != -1) {
return repuesta;
}
// [1,3,5,6] 7
int numeroActual;
for (int i = 0 ; i < nums.length ; i++) {
numeroActual = nums[i];
if (numeroActual < target) {
resultado = i+1;
}
if (numeroActual > target) {
return resultado;
}
}
return resultado;
}
public static int existeEnArray(int[] nums, int target){
int resultado = -1;
for (int i = 0 ; i < nums.length ; i++) {
if (nums[i] == target) {
return i;
}
if (nums[i] > target) {
return resultado;
}
}
return resultado;
}
}