[leetcode]-4. Median of Two Sorted Arrays（C语言）

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

double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size) {
    int len=nums1Size+nums2Size-1;
    int a[len+1],k=0,i=0,j=0;
    while(i<nums1Size&&j<nums2Size)
    {
        if(nums1[i]<nums2[j])
        {
            a[k]=nums1[i];
            k++;i++;
        }
        else
        {
            a[k]=nums2[j];
            k++;
            j++;
        }
    }
    while(i<nums1Size)
    {
        a[k++]=nums1[i++];
    }
    while(j<nums2Size)
        a[k++]=nums2[j++];
    if((nums1Size+nums2Size)%2==1)
        return a[len/2];
    double b=a[len/2];
    b=(b+a[(len+1)/2])/2;
    return b;
}