Leetcode 之 Median of Two Sorted Arrays

C语言版

double find_kth(int* nums1, int nums1Size, int* nums2, int nums2Size, int k, int c) {
    if (0 == nums1Size) {
        if (0 == c) return nums2[k - 1];
        else return (nums2[k - 1] + nums2[k]) / 2.0;
    }
    if (0 == nums2Size) {
        if (0 == c) return nums1[k - 1];
        else return (nums1[k - 1] + nums1[k]) / 2.0;
    }
    if (k == 1) {
        if (*nums1 < *nums2) {
            if (0 == c) return *nums1;
            else return (*nums1 + find_kth(nums1 + 1, nums1Size - 1, nums2, nums2Size, 1, 0)) / 2.0;
        }
        else {
            if (0 == c) return *nums2;
            else return (*nums2 + find_kth(nums1, nums1Size, nums2 + 1, nums2Size - 1, 1, 0)) / 2.0;
        }
    }
    int i1 = k / 2 - 1;
    if (i1 >= nums1Size) i1 = nums1Size - 1;
    int i2 = k - 2 - i1;
    if (i2 >= nums2Size) {
        i2 = nums2Size - 1;
        i1 = k - 2 - i2;
    }
    if (nums1[i1] == nums2[i2]) {
        if (0 == c) return nums1[i1];
        else return (nums1[i1] + find_kth(nums1 + i1 + 1, nums1Size - i1 - 1, nums2 + i2 + 1, nums2Size - i2 - 1, 1, 0)) / 2.0;
    }
    else if (nums1[i1] < nums2[i2]) {
        return find_kth(nums1 + i1 + 1, nums1Size - i1 - 1, nums2, nums2Size, k - i1 - 1, c);
    }
    else {
        return find_kth(nums1, nums1Size, nums2 + i2 + 1, nums2Size - i2 - 1, k - i2 - 1, c);
    }
}

double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size) {
    if (0 == ((nums1Size + nums2Size) & 0x1))
    return find_kth(nums1, nums1Size, nums2, nums2Size, (nums1Size + nums2Size) / 2    , 1);
    return find_kth(nums1, nums1Size, nums2, nums2Size, (nums1Size + nums2Size) / 2 + 1, 0);
}
时间： 2024-10-10 13:00:31

Leetcode 之 Median of Two Sorted Arrays的相关文章

LeetCode(3) || Median of Two Sorted Arrays

LeetCode(3) || Median of Two Sorted Arrays 题记 之前做了3题,感觉难度一般,没想到突然来了这道比较难的,星期六花了一天的时间才做完,可见以前基础太差了. 题目内容 There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should

【题解】【数组】【Leetcode】Median of Two Sorted Arrays

Median of Two Sorted Arrays There are two sorted arrays A and B 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)). ? 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

LeetCode OJ - Median of Two Sorted Arrays

题目: There are two sorted arrays A and B 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)). 解题思路: 将原问题转变成一个寻找第k小数的问题(假设两个原序列升序排列),这样中位数实际上是第(m+n)/2小的数.所以只要解决了第k小数的问题,原问题也得以解决

[LeetCode][JavaScript]Median of Two Sorted Arrays

Median of Two Sorted Arrays 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)). https://leetcode.com/problems/median-of-two-sorted

第三周 leetcode 4. Median of Two Sorted Arrays (HARD)

4. Median of Two Sorted Arrays 给定两个有序的整数序列.求中位数,要求复杂度为对数级别. 通常的思路,我们二分搜索中位数,对某个序列里的某个数 我们可以在对数时间内通过二分算法求得两个序列中比它小的数,整体复杂度也是对数级别.但是代码实现较为困难. 换一个思路,我们把中位数不要当作一个数,而当作一个序列的划分.划分后,序列的左半部设为L,右半部设为R 满足max(L)<=min(R)且满足len(L)==len(R) 二分搜索这个划分即可.对于A+B的长度为奇数的情

leetcode 2.Median of Two Sorted Arrays

Median of Two Sorted Arrays Problem: There are two sorted arrays A and B 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)). 解题思路:如果是一个已排序数组,求中位数,可以直接计算.因此比较常规的想法是直接将两个有序数组合并

【LeetCode】Median of Two Sorted Arrays (2 solutions)

Median of Two Sorted Arrays There are two sorted arrays A and B 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)). 解法一:保底做法,O(m+n)复杂度 按照归并排序的思路,数到median,然后计算返回. 需要注意: 如果是m+n

leetcode之Median of Two Sorted Arrays

Median of Two Sorted Arrays There are two sorted arrays A and B 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)). 首先假设数组A和B的元素个数都大于k/2,我们比较A[k/2-1]和B[k/2-1]两个元素,这两个元素分别表示A的

[LeetCode][Python]Median of Two Sorted Arrays

# -*- coding: utf8 -*-'''https://oj.leetcode.com/problems/median-of-two-sorted-arrays/ There are two sorted arrays A and B 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)).

LeetCode题解-----Median of Two Sorted Arrays

题目描述: 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)). 解题思路: 本题要求求解的是两个有序序列的中位数.本质上就是求两个有序序列“第k小的数“的变形.假设两个有序序列一个长为m,另一个长为n,则我们