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思路:简单归并题,注意长度和为奇偶时的情况,以及返回值需要转换为double
代码如下:
public class Solution {
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
int ilen = nums1.length+nums2.length;
boolean isodd = (ilen&1) != 0?true:false;
int i = 0,j = 0,k = 0;
ilen >>= 1;
int temp[] = new int[ilen+1];
while(i <= ilen && j < nums1.length && k < nums2.length)
{
if(nums1[j] < nums2[k])
{
temp[i++] = nums1[j++];
}
else
{
temp[i++] = nums2[k++];
}
}
while(i <= ilen && j < nums1.length)
{
temp[i++] = nums1[j++];
}
while(i <= ilen && k < nums2.length)
{
temp[i++] = nums2[k++];
}
if(isodd)
{
return (double)temp[ilen];
}
else
{
return (double)(temp[ilen]+temp[ilen-1])/2.0;
}
}
}