LeetCode--4. Median of Two Sorted Arrays

最新推荐文章于 2024-11-02 14:41:43 发布

冬风噬雪

最新推荐文章于 2024-11-02 14:41:43 发布

阅读量238

点赞数

分类专栏： LeetCode C++ 文章标签： LeetCode c++

本文链接：https://blog.csdn.net/u011319202/article/details/70837513

版权

LeetCode 同时被 2 个专栏收录

15 篇文章 0 订阅

订阅专栏

C++

12 篇文章 0 订阅

订阅专栏

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

C++

class Solution {
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
        vector<int> nums3;
        float medians = 0;
        if(nums1.size() == 0)
        {
            if(nums2.size()%2 == 0)
            {
                return medians = (nums2[nums2.size()/2] + nums2[nums2.size()/2 - 1])/2.0;
            }
            else
            {
                return medians = nums2[(nums2.size()-1)/2]; 
            }
        }

        if(nums2.size() == 0)
        {
            if(nums1.size()%2 == 0)
            {
                return medians = (nums1[nums1.size()/2] + nums1[nums1.size()/2 - 1])/2.0;
            }
            else
            {
                return medians = nums1[(nums1.size()-1)/2]; 
            }
        }

        int k = nums1.size() + nums2.size();


        int i = 0;
        int n =0, m = 0;

        if(k % 2 == 0)
        {
            k = k/2 + 1;
            while(i <= k)
            {
                if(m < nums1.size() && n < nums2.size())
                {
                        if(nums1[m] <= nums2[n])
                    {
                        nums3.push_back(nums1[m]);
                        m++;
                        i++;
                    }
                    else
                    {
                        nums3.push_back(nums2[n]);
                        n++;
                        i++;
                    }
                }
                else
                {
                    if(n == nums2.size())
                    {
                        nums3.push_back(nums1[m]);
                        m++;
                        i++;
                    }
                    if(m == nums1.size())
                    {
                        nums3.push_back(nums2[n]);
                        n++;
                        i++;
                    }
                }

            }
            medians = (nums3[k-2] + nums3[k-1]) / 2.0;
        }
        else
        {
            k = (k + 1)/2;
            while(i <= k)
            {
                if(m < nums1.size() && n < nums2.size())
                {
                        if(nums1[m] <= nums2[n])
                    {
                        nums3.push_back(nums1[m]);
                        m++;
                        i++;
                    }
                    else
                    {
                        nums3.push_back(nums2[n]);
                        n++;
                        i++;
                    }
                }
                else
                {
                    if(n == nums2.size())
                    {
                        nums3.push_back(nums1[m]);
                        m++;
                        i++;
                    }
                    if(m == nums1.size())
                    {
                        nums3.push_back(nums2[n]);
                        n++;
                        i++;
                    }
                }

            }
            medians = nums3[k-1];
        }
        return medians;
    }
};