leetcode:4. 寻找两个正序数组的中位数（C语言）

#define MAX_LEN 2000
int nums[2000] = {0};

void mergeArray(int *nums, int *numsSize, int* nums1, int nums1Size, int* nums2, int nums2Size)
{
    int i = 0;
    int j = 0;
    int k = 0;
    while (i < nums1Size && j < nums2Size) {
        if (nums1[i] <= nums2[j]) {
            nums[k++] = nums1[i++];
        } else {
            nums[k++] = nums2[j++]; 
        }
    }

    while (i < nums1Size) {
        nums[k++] = nums1[i++];
    }

    while (j < nums2Size) {
        nums[k++] = nums2[j++];
    }
    *numsSize = k;
    return;
}

void printf_array(int *nums, int numsSize) 
{
    for (int i = 0; i < numsSize; i++) {
        printf("%d ", nums[i]);
    }

    printf("\n");
    return;
}
double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size){
    int numsSize;
    mergeArray(nums, &nu