leetcode-4：寻找两个正序数组的中位数

double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size){
    int n = nums1Size, m = nums2Size;
    int* temp = (int*)malloc(sizeof(int*) * (n + m));
    int p1 = 0, p2 = 0, k = 0;
    while(p1 < n || p2 < m){
        if(p2 == m || (p1 < n && nums1[p1] <= nums2[p2])){
            temp[k++] = nums1[p1++];
        }else{
            temp[k++] = nums2[p2++];
        }
    }
    double a = temp[(n + m) / 2], b = temp[(n + m) / 2];
    if((n + m) % 2 == 0) b = temp[(n + m) / 2 - 1];
    return (a + b) / 2.0;
}

 二分：

int findk(int* num1, int n1, int ind1, int* num2, int n2, int ind2, int k) {
    if (k == 1) {
        int a = n1 == ind1 ? 2100000000 : num1[ind1];
        int b = n2 == ind2 ? 2100000000 : num2[ind2];
        return a < b ? a : b;
    }
    if (ind1 == n1) return num2[k - 1 + ind2];
    if (ind2 == n2) return num1[k - 1 + ind1];
    int cnt1 = k / 2 < n1 - ind1 ? k / 2 : n1 - ind1;
    int cnt2 = k - cnt1 < n2 - ind2 ? k - cnt1 : n2 - ind2;
    cnt1 = k - cnt2;
    if (num1[ind1 + cnt1 - 1] <= num2[ind2 + cnt2 - 1]) 
        return findk(num1, n1, ind1 + cnt1, num2, n2, ind2, k - cnt1);
    return findk(num1, n1, ind1, num2, n2, ind2 + cnt2, k - cnt2);
}

double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size) {
    int n = nums1Size, m = nums2Size;
    if ((n + m) % 2 == 1) return findk(nums1, n, 0, nums2, m, 0, (n + m) / 2 + 1);
    double a = findk(nums1, n, 0, nums2, m, 0, (n + m) / 2);
    double b = findk(nums1, n, 0, nums2, m, 0, (n + m) / 2 + 1);
    return (a + b) / 2;
}