-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution4.java
105 lines (87 loc) · 2.9 KB
/
Solution4.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
93
94
95
96
97
98
99
100
101
102
103
104
105
package solutions;
public class Solution4 {
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
var len1 = nums1.length;
var len2 = nums2.length;
var mergedLen = len1 + len2;
var mergedArr = new int[mergedLen];
var median = 0d;
var midIndex = mergedLen / 2;
var left = 0;
var right = 0;
var mergedArrIndex = 0;
// Merge nums1 and nums2 into mergedArr
while (left < len1 && right < len2) {
if (nums1[left] < nums2[right]) {
mergedArr[mergedArrIndex++] = nums1[left++];
}
else {
mergedArr[mergedArrIndex++] = nums2[right++];
}
}
// Copy any remaining elements from nums1
while (left < len1) {
mergedArr[mergedArrIndex++] = nums1[left++];
}
// Copy any remaining elements from nums2
while (right < len2) {
mergedArr[mergedArrIndex++] = nums2[right++];
}
if (mergedLen % 2 == 0) {
median = (mergedArr[midIndex] + mergedArr[midIndex - 1]) / 2.0;
}
else {
median = mergedArr[midIndex];
}
return median;
}
public double findMedianSortedArrays2(int[] nums1, int[] nums2) {
var m = nums1.length;
var n = nums2.length;
// Ensure nums1 is the smaller array.
if (m > n) {
var temp = nums1; // swap nums1 and nums2
nums1 = nums2;
nums2 = temp;
var tmp = m; // swap m and n
m = n;
n = tmp;
}
var left = 0;
var right = m;
var halfLength = (m + n + 1) / 2;
while (left <= right) {
var i = (left + right) / 2;
var j = halfLength - i;
if (i < right && nums2[j - 1] > nums1[i]) {
left = i + 1; // i is too small
}
else if (i > left && nums1[i - 1] > nums2[j]) {
right = i - 1; // i is too big
}
else { // Edge cases: i is perfect
var maxLeft = 0;
var minRight = 0;
if (i == 0) {
maxLeft = nums2[j - 1];
} else if (j == 0) {
maxLeft = nums1[i - 1];
} else {
maxLeft = Math.max(nums1[i - 1], nums2[j - 1]);
}
if ((m + n) % 2 == 1) {
return maxLeft; // Odd number of elements
}
if (i == m) {
minRight = nums2[j];
} else if (j == n) {
minRight = nums1[i];
} else {
minRight = Math.min(nums2[j], nums1[i]);
}
return (maxLeft + minRight) / 2.0; // Even number of elements
}
}
return 0.0;
}
}