LeetCode Top 100 Liked Questions 4.Median of Two Sorted Arrays(Java版; Hard)
题目描述
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)).
You may assume nums1 and nums2 cannot be both empty.
Example 1:
nums1 = [1, 3]
nums2 = [2]
The median is 2.0
Example 2:
nums1 = [1, 2]
nums2 = [3, 4]
The median is (2 + 3)/2 = 2.5
(1)在两个排序数组中找到第k小的数
classSolution{publicdoublefindMedianSortedArrays(int[] nums1,int[] nums2){int n = nums1.length, m = nums2.length;int count = n + m;if((count&1)==1){returncore(nums1, nums2,0,0, count/2+1);}else{return(core(nums1, nums2,0,0, count/2)+core(nums1, nums2,0,0, count/2+1))/2.0;}}privatedoublecore(int[] nums1,int[] nums2,int i,int j,int k){//base caseint n = nums1.length, m = nums2.length;if(i>=n){return nums2[j+k-1];}elseif(j>=m){return nums1[i+k-1];}if(k==1){return Math.min(nums1[i], nums2[j]);}//第k/2个数的索引int mid1 = i + k/2-1;int mid2 = j + k/2-1;int a = mid1 >= n ? Integer.MAX_VALUE : nums1[mid1];int b = mid2 >= m ? Integer.MAX_VALUE : nums2[mid2];if(a<b){returncore(nums1, nums2, mid1+1, j, k-k/2);}else{returncore(nums1, nums2, i, mid2+1, k-k/2);}}}
class Solution {
public double findMedianSortedArrays(int[] A, int[] B) {
int m = A.length;
int n = B.length;
if (m > n) { // to ensure m<=n
int[] temp = A; A = B; B = temp;
int tmp = m; m = n; n = tmp;
}
int iMin = 0, iMax = m, halfLen = (m + n + 1) / 2;
while (iMin <= iMax) {
int i = (iMin + iMax) / 2;
int j = halfLen - i;
if (i < iMax && B[j-1] > A[i]){
iMin = i + 1; // i is too small
}
else if (i > iMin && A[i-1] > B[j]) {
iMax = i - 1; // i is too big
}
else { // i is perfect
int maxLeft = 0;
if (i == 0) { maxLeft = B[j-1]; }
else if (j == 0) { maxLeft = A[i-1]; }
else { maxLeft = Math.max(A[i-1], B[j-1]); }
if ( (m + n) % 2 == 1 ) { return maxLeft; }
int minRight = 0;
if (i == m) { minRight = B[j]; }
else if (j == n) { minRight = A[i]; }
else { minRight = Math.min(B[j], A[i]); }
return (maxLeft + minRight) / 2.0;
}
}
return 0.0;
}
}
LeetCode Top 100 Liked Questions 4.Median of Two Sorted Arrays(Java版; Hard)
welcome to my blogLeetCode Top 100 Liked Questions 4.Median of Two Sorted Arrays(Java版; Hard)题目描述There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the tw...