LeetCode-4_MedianOfTwoSortedArrays-C++

最新推荐文章于 2024-09-27 15:30:00 发布

镇上村树

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量198

点赞数

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

本文链接：https://blog.csdn.net/realDonaldTrump/article/details/78243043

版权

leetcode 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

本人博客已经迁移到nasdaqgodzilla.github.io

/*
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
*/

#include <iostream>
#include <vector>

using namespace std;

class Solution
{
public:
    /*arg1 and arg2 are sorted.*/
    static double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2)
    {
        double ret = 0.0;
        auto nums1Length = nums1.size();
        auto nums2Length = nums2.size();

        double median1 = (nums1Length % 2 != 0) ?
                        nums1[nums1Length / 2] :
                        ((nums1[nums1Length / 2] + nums1[nums1Length / 2 -1])/2.0)
                        ;
        double median2 = (nums2Length % 2 != 0) ?
                        nums2[nums2Length / 2] :
                        ((nums2[nums2Length / 2] + nums2[nums2Length / 2 -1])/2.0)
                        ;

        ret = (median2 + median1) / 2.0;

        return ret;
    }
};

int main()
{
    vector<int> nums1 = {1,2};
    vector<int> nums2 = {3,4};
    auto ret = Solution::findMedianSortedArrays(nums1,nums2);
    cout << ret << endl;

    return 0;
}