自己写的归并,复杂度是O(m + n)
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
//if(nums1 == null && nums2 == null) return 0.0;
int len1 = nums1.length;
int len2 = nums2.length;
//if(len1 == 0 && len2 == 0) return 0.0;
double res = 0.0;
if(len1 == 0){
if(len2 % 2 == 1){
res = nums2[len2 / 2];
} else {
res = (nums2[len2 / 2] + nums2[len2 / 2 - 1]) / 2.0;
}
}
if(len2 == 0){
if(len1 % 2 == 1){
res = nums1[len1 / 2];
} else {
res = (nums1[len1 / 2] + nums1[len1 / 2 - 1]) / 2.0;
}
}
int len = len1 + len2;
int[] arr = new int[len];
int i = 0,j = 0;
int index = 0;
while(index < len){
if(i == len1){
while(j < len2){
arr[index++] = nums2[j++];
}
} else if(j == len2){
while(i < len1){
arr[index++] = nums1[i++];
}
} else if(nums1[i] < nums2[j]){
arr[index++] = nums1[i++];
} else {
arr[index++] = nums2[j++];
}
}
if(len % 2 == 1){
res = arr[len / 2];
} else {
res = (arr[len / 2] + arr[len / 2 - 1]) / 2.0;
}
return res;
}
评论区的二分解法
作者:Wait想念
代码来源:https://leetcode-cn.com/problems/median-of-two-sorted-arrays/comments/
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
int m = nums1.length;
int n = nums2.length;
int left = (m + n + 1) / 2;
int right = (m + n + 2) / 2;
return (findKth(nums1, 0, nums2, 0, left) + findKth(nums1, 0, nums2, 0, right)) / 2.0;
}
//i: nums1的起始位置 j: nums2的起始位置
public int findKth(int[] nums1, int i, int[] nums2, int j, int k){
if( i >= nums1.length) return nums2[j + k - 1];//nums1为空数组
if( j >= nums2.length) return nums1[i + k - 1];//nums2为空数组
if(k == 1){
return Math.min(nums1[i], nums2[j]);
}
int midVal1 = (i + k / 2 - 1 < nums1.length) ? nums1[i + k / 2 - 1] : Integer.MAX_VALUE;
int midVal2 = (j + k / 2 - 1 < nums2.length) ? nums2[j + k / 2 - 1] : Integer.MAX_VALUE;
if(midVal1 < midVal2){
return findKth(nums1, i + k / 2, nums2, j , k - k / 2);
}else{
return findKth(nums1, i, nums2, j + k / 2 , k - k / 2);
}
}