[LeetCode] Median of Two Sorted Arrays [16]

题目

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)).

原题链接(点我)

解题思路

返回两个排序数组的中位数。这个题可以有以下几个思路:

首先可以想到的是将两个数组merge起来,然后返回其中位数。

第二个是,类似merge的思想加上计数,找到(m+n)/2个数或者其前后的数,这个就可以算出中位数。这个方法对于各种情况需要一一考虑到。

第三个,假设A[k/2-1]<B[k/2-1],那么A[k/2-1]之前的数一定在整个有序数列中(m+n)/2之前。

这里我给出后面两种思路的代码。

代码实现

代码一(思路三)
class Solution {
public:
    double findMedianSortedArrays(int A[], int m, int B[], int n) {
        int len = m+n;
        if(len & 0x1){
            return findkth(A, m, B, n, len/2 +1);
        }else{
            return ( findkth(A, m, B, n, len/2) + findkth(A, m, B, n, len/2+1) )/2.0;
        }
    }

    double findkth(int A[], int m, int B[], int n, int k){
        if(m>n) return findkth(B, n, A, m, k);
        if(m==0) return B[k-1];
        if(k==1) return min(A[0], B[0]);
        int Aindex = min(m, k/2);
        int Bindex = k-Aindex;
        if(A[Aindex-1] < B[Bindex-1]){
            return findkth(A+Aindex, m-Aindex, B, n, k-Aindex);
        }
        else if(A[Aindex-1] > B[Bindex-1]){
            return findkth(A, m, B+Bindex, n-Bindex, k-Bindex);
        }
        else{
            return A[Aindex-1];
        }
    }
};
代码二(思路二--计数)
class Solution {
public:
    double findMedianSortedArrays(int A[], int m, int B[], int n) {
        int ret = -1;
        if((A==NULL && B==NULL) || m<0 || n<0)
            return (double)ret;
        if(A==NULL || m<=0){
            if(n & 1)
                return (double)B[n/2];
            else{
                return (double)(B[n/2]+B[n/2-1]) / 2.0;
            }
        }
        if(B==NULL || n<=0){
            if(m & 1)
                return (double)A[m/2];
            else{
                return (double)(A[m/2]+A[m/2-1]) / 2.0;
            }
        }
        int mid = (m+n)/2;
        int pre = 0;
        int i=0, j=0;
        int count=0;
        int token = 0;
        while(i<m && j<n){
            if(A[i]<=B[j]){
                if(count!=mid)
                    pre = A[i];
                if(count==mid){
                    token = A[i];++count;
                    break;
                }
                ++i;
            }else{
                if(count!=mid)
                    pre = B[j];
                if(count==mid){
                    token = B[j];++count;
                    break;
                }
                ++j;
            }
            ++count;
        }
        if(count<=mid){
            if(i<m){
                if(count==mid){
                    token = A[i];
                }else{
                    while(count<mid){
                        pre = A[i++];
                        ++count;
                    }
                    token = A[i];
                }
            }
            if(j<n){
                if(count==mid){
                    token = B[j];
                }else{
                    while(count<mid){
                        pre = B[j++];
                        ++count;
                    }
                    token = B[j];
                }
            }
        }

        if((m+n) & 1 ){
            //odd
            return (double)(token);
        }
        else{
            //even
            return (double)(pre+token)/2.0;
        }
    }
};

参考

http://blog.csdn.net/yutianzuijin/article/details/11499917

-----------------------------------------------------------------------------------------------------------------------------------

如果你觉得本篇对你有收获,请帮顶。

另外,我开通了微信公众号--分享技术之美,我会不定期的分享一些我学习的东西.

你可以搜索公众号:swalge 或者扫描下方二维码关注我

(转载文章请注明出处: http://blog.csdn.net/swagle/article/details/29197389
)

[LeetCode] Median of Two Sorted Arrays [16]

时间: 2024-10-27 08:30:47

[LeetCode] Median of Two Sorted Arrays [16]的相关文章

LeetCode——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,大小为m 和 n. 找出两数组的中位数 时间复杂度应该为 O(log (m+n)). 简单粗暴的方法就是把两个数组合并成一个数组,排序,取中位数.

[leetcode]Median of Two Sorted Arrays @ Python

原题地址: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 寻找2个有序数组中第k大的值

问题 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)). 分析 本题更经典通用的描述方式时: 给定2个有序数组,找出2个数组中所有元素中第k大的元素. 思路1 直观思

LeetCode—Median of Two Sorted Arrays

Median of Two Sorted Arrays 这道题要找Median,中位数.这个是指,如果数组大小是偶数,返回中间两个数的平均值,如果是奇数个,就是中间的数. 算法时间效率要求是 O(log(m + n)),具体思路网上都一样. 另外,现在leetCode的C++ 数组都换成vector了,所以只好整理一下vector的用法. 参考:http://imatlab.lofter.com/post/286ffc_a81276 http://www.cnblogs.com/wang7/ar

[JS做LeetCode] Median of Two Sorted Arrays

Median of Two Sorted Arrays <html> <head> <meta http-equiv="charset" content="utf-8"></head> <body> <script> //解题思路: //找出中位数要循环的次数为loop //posA为数组A的下标,posB为数组B的下标 //每次循环找出两个数组对应下标比较小的值,进栈,下标+1 //注意判断数

[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)). Subscribe to see which companies asked this question Show Tags 分析: 这个题目在leetco

(Leetcode) Median of Two Sorted Arrays (Hard)

題目: 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)). Code: 1 class Solution 2 { 3 public: 4 double findMedianSortedArrays(vecto

[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)). http://www.acmerblog.com/leetcode-median-of-two-sorted-arrays-5330.html http:/

LeetCode Median of Two Sorted Arrays 找中位数(技巧)

题意: 给两个有序(升or降)的数组,求两个数组合并之后的中位数. 思路: 按照找第k大的思想,很巧妙.将问题的规模降低,对于每个子问题,k的规模至少减半. 考虑其中一个子问题,在两个有序数组中找第k大,我们的目的只是将k的规模减半而已,所以可以对比nums1[k/2]和nums2[k/2]的大小,假设nums1[k/2]<=nums2[k/2],那么nums1[0~k/2]这部分必定在0~k之中,那么将这部分删去,k减半,再递归处理.这里面可能有一些细节问题要考虑: 1. 如果其中1个数组的大