We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 7e600d7 commit 48020d2Copy full SHA for 48020d2
solution/0004.Median of Two Sorted Arrays/README.md
@@ -55,7 +55,6 @@ class Solution {
55
int len1 = nums1.length;
56
int len2 = nums2.length;
57
58
- // 确保 len1 不大于 len2
59
if (len1 > len2) {
60
int[] tmp = nums1;
61
nums1 = nums2;
@@ -69,10 +68,9 @@ class Solution {
69
68
int max = len1;
70
71
int m = (len1 + len2 + 1) / 2;
72
-
+
73
while (min <= max) {
74
int i = (min + max) / 2;
75
76
int j = m - i;
77
78
if (i > min && nums1[i - 1] > nums2[j]) {
@@ -87,7 +85,7 @@ class Solution {
87
85
return maxLeft;
88
86
}
89
90
- int minRight = i == len1 ? nums2[j] : j == len2 ? nums1[i] : Math.min(nums2[i], nums1[j]);
+ int minRight = i == len1 ? nums2[j] : j == len2 ? nums1[i] : Math.min(nums2[j], nums1[i]);
91
92
return (maxLeft + minRight) / 2.0;
93
0 commit comments