-
Notifications
You must be signed in to change notification settings - Fork 0
/
medianOfSortedList.java
92 lines (69 loc) · 2.07 KB
/
medianOfSortedList.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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
//check my youtube page on my page juanmoraza.com
public double medianOfSortedList(int[] nums1, int[] nums2) {
int m = nums1.length;
int n = nums2.length;
int median1 = (m + n) / 2; //1
int median2 = median1 - 1; //0
int i = 0;
int j = 0;
int m1 = 0;
int m2 = 0;
int index = 0;
double total = 0;
boolean even = ((m + n) % 2 == 0);
boolean inM = true;
boolean inN = true;
if (m == 0)
inM = false;
if (n == 0)
inN = false;
while (true) {
if (inM && inN && nums1[i] <= nums2[j]) {
if (index == median2) {
m2 = nums1[i];
}
if (index == median1) {
m1 = nums1[i];
break;
}
i++;
if (i >= m)
inM = false;
} else if (inM && inN && nums1[i] > nums2[j]) {
if (index == median2)
m2 = nums2[j];
if (index == median1) {
m1 = nums2[j];
break;
}
j++;
if (j >= n)
inN = false;
} else if (j < n) {
if (index == median2)
m2 = nums2[j];
if (index == median1) {
m1 = nums2[j];
break;
}
j++;
} else if (i < m) {
if (index == median2) {
m2 = nums1[i];
}
if (index == median1) {
m1 = nums1[i];
break;
}
i++;
} else {
break;
}
index++;
}
if (even) {
return (m1 + m2) / 2.0;
} else {
return m1 * 1.0;
}
}