2017-09-07 LeetCode_004 Median of Two Sorted Arrays

最新推荐文章于 2021-03-09 19:39:31 发布

SYSU_LiuBY

最新推荐文章于 2021-03-09 19:39:31 发布

阅读量123

点赞数

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

本文链接：https://blog.csdn.net/qq_33575106/article/details/77883697

版权

作业专栏收录该内容

49 篇文章 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

Solution:

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