LeetCode 4

最新推荐文章于 2020-02-07 17:57:15 发布

BoBo文

最新推荐文章于 2020-02-07 17:57:15 发布

阅读量713

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/weixin_40987905/article/details/79375874

版权

LeetCode 专栏收录该内容

7 篇文章

订阅专栏

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

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

需要熟悉vector的使用方法；

class Solution {
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
        vector<double>v;
        int m=nums1.size(),n=nums2.size();
        double median=0;
        for(int i=0;i<m;i++)
            v.push_back(nums1[i]);
        for(int i=0;i<n;i++)
            v.push_back(nums2[i]);
        sort(v.begin(),v.end());
        int avg=(n+m)/2;
        if((m+n)%2==0) median=(v[avg-1]+v[avg])/2;
        else  median=v[avg];
        return median;
    }
};