题目链接:https://leetcode-cn.com/problems/median-of-two-sorted-arrays/
给定两个大小分别为
m
和n
的正序(从小到大)数组nums1
和nums2
。请你找出并返回这两个正序数组的 中位数 。
示例 1:
输入:nums1 = [1,3], nums2 = [2] 输出:2.00000 解释:合并数组 = [1,2,3] ,中位数 2
示例 2:
输入:nums1 = [1,2], nums2 = [3,4] 输出:2.50000 解释:合并数组 = [1,2,3,4] ,中位数 (2 + 3) / 2 = 2.5
示例 3:
输入:nums1 = [0,0], nums2 = [0,0] 输出:0.00000
示例 4:
输入:nums1 = [], nums2 = [1] 输出:1.00000
示例 5:
输入:nums1 = [2], nums2 = [] 输出:2.00000
提示:
nums1.length == m
nums2.length == n
0 <= m <= 1000
0 <= n <= 1000
1 <= m + n <= 2000
-106 <= nums1[i], nums2[i] <= 106
进阶:你能设计一个时间复杂度为 O(log (m+n)) 的算法解决此问题吗?
double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size)
{
int* ar = (int*)malloc(sizeof(int) * 2001);
int count = 0;
int half = (nums1Size + nums2Size) / 2 + 1;
int i = 0,j = 0;
while (count < half && i < nums1Size && j < nums2Size)
{
if (nums1[i] <= nums2[j])
{
ar[count++] = nums1[i++];
}
else
{
ar[count++] = nums2[j++];
}
}
while (count < half && i <nums1Size)
{
ar[count++] = nums1[i++];
}
while (count < half && j <nums2Size)
{
ar[count++] = nums2[j++];
}
double target = 0;
if ((nums1Size + nums2Size) & 1 )
{
target = ar[count-1];
}
else
{
target = (ar[count-1] + ar[count-2]) / 2.0;
}
free(ar);
return target;
}
谢谢。