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
| package algorithm;
import java.util.Arrays;
public class FindMedianSortedArrays {
public static double findMedianSortedArrays(int[] nums1, int[] nums2) {
int [] nums3 = new int[nums1.length + nums2.length];
if (nums2.length == 0 && nums1.length == 0) {
return 0;
}
if (nums1.length == 0) {
return getMidNum(nums2);
}
if (nums2.length == 0) {
return getMidNum(nums1);
}
for (int i = 0, j = 0, k = 0; ;) {
if (nums1[i] < nums2[j]) {
nums3[k] = nums1[i];
i++;
k++;
} else if (nums1[i] > nums2[j]) {
nums3[k] = nums2[j];
j++;
k++;
} else if (nums1[i] == nums2[j]) {
nums3[k] = nums2[j];
j++;
k++;
}
if (i == nums1.length) {
for (; j < nums2.length; j++, k++) {
nums3[k] = nums2[j];
}
break;
}
if (j == nums2.length) {
for (; i < nums1.length; i++, k++) {
nums3[k] = nums1[i];
}
break;
}
}
System.out.println(Arrays.toString(nums3));
return getMidNum(nums3);
}
private static double getMidNum(int[] nums3) {
if(nums3.length % 2 == 1) {
return nums3[(nums3.length - 1)/2];
} else {
return (nums3[(nums3.length - 1)/2] + nums3[(nums3.length)/2]) / 2.0;
}
}
public static void main(String[] args) {
int[] nums1 = new int[]{1, 3}, nums2 = new int[]{2};
System.out.println(findMedianSortedArrays(nums1, nums2));
int[] nums3 = new int[]{1,2}, nums4 = new int[]{3,4};
System.out.println(findMedianSortedArrays(nums3, nums4));
int[] nums5 = new int[]{0,0}, nums6 = new int[]{0,0};
System.out.println(findMedianSortedArrays(nums5, nums6));
int[] nums7 = new int[]{}, nums8 = new int[]{1};
System.out.println(findMedianSortedArrays(nums7, nums8));
int[] nums9 = new int[]{2}, nums10 = new int[]{};
System.out.println(findMedianSortedArrays(nums9, nums10));
int[] nums11 = new int[]{0,0,0,0,0}, nums12 = new int[]{-1,0,0,0,0,0,1};
System.out.println(findMedianSortedArrays(nums11, nums12));
}
}
|