-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMediaNum.java
More file actions
62 lines (59 loc) · 1.64 KB
/
MediaNum.java
File metadata and controls
62 lines (59 loc) · 1.64 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
package LeetCodeOJ;
/* 4. Median of Two Sorted Arrays
* There are two sorted arrays nums1 and nums2 of size m and n respectively.
* Find the median of the two sorted arrays.
* The overall run time complexity should be O(log (m+n)).
*/
public class MediaNum {
/*
* O(m+n)
*/
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
int len = 0;
if ((nums1.length + nums2.length) % 2 == 0) {
len = (nums1.length + nums2.length) / 2;
} else {
len = (nums1.length + nums2.length) / 2 + 1;
}
int i = 0, j = 0, k = 0;
int result = 0;
while (i < nums1.length && j < nums2.length) {
if (len == k) {
return result;
} else {
if (nums1[i] < nums2[j]) {
result = nums1[i];
i++;
} else {
result = nums2[j];
j++;
}
k++;
}
}
while (i < nums1.length) {
if (k == len) {
break;
} else {
result = nums1[i];
k++;
i++;
}
}
while (j < nums2.length) {
if (k == len) {
break;
} else {
result = nums2[j];
k++;
j++;
}
}
return result;
}
public static void main(String[] args) {
int[] n1 = { 1, 4, 6, 7, 9 };
int[] n2 = { 2, 5, 8, 14, 15, 18 };
System.out.println(new MediaNum().findMedianSortedArrays(n1, n2));
}
}