一、题意
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)).
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、思路:把两个数组按照从大到小的顺序存到新的数组中,返回中位数即可。代码如下:
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
int len1 = nums1.length;
int len2 = nums2.length;
int len = len1 + len2;
int[] arr = new int[len];
int i=0,j=0,count=0;
while(i < len1 || j < len2){
if(i < len1 && j < len2){
if(nums1[i] < nums2[j])
arr[count++] = nums1[i++];
else
arr[count++] = nums2[j++];
}
if(i == len1 && j < len2)//注意这里,第二个条件
arr[count++] = nums2[j++];
if(j == len2 && i < len1)
arr[count++] = nums1[i++];
}
if(len % 2 == 1)//注意这里和下标
return arr[len/2];
else
return ((double)(arr[len/2-1] + arr[len/2])) / 2;
}
这种方法是最普通最常用的一种方法,即合并两个数组。看下面的别人的想法!
2、第二种思路(涉及到归并排序和二分查找)
参考:https://blog.csdn.net/qq_14821023/article/details/50806849