leetcode Median of Two Sorted Arrays

最新推荐文章于 2023-06-12 16:30:30 发布

ych19871020

最新推荐文章于 2023-06-12 16:30:30 发布

阅读量355

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/ych19871020/article/details/45879605

版权

leetcode 专栏收录该内容

16 篇文章

订阅专栏

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

class Solution {
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
        nums1.insert(nums1.begin(),nums2.begin(),nums2.end());
        sort(nums1.begin(),nums1.end());
        
        int len = nums1.size();
        if (len % 2 == 0)
        {
            return (nums1[len/2] + nums1[len/2-1])/(double)2;
        }
        
        return nums1[len/2];
    }
};