[2019-04-04] LeetCode: 4. Median of Two Sorted Arrays

最新推荐文章于 2023-12-16 16:41:11 发布

来一串82年de葡萄干

最新推荐文章于 2023-12-16 16:41:11 发布

阅读量75

点赞数

分类专栏： Leetcode 文章标签： LeetCode

本文链接：https://blog.csdn.net/weixin_43951303/article/details/89012780

版权

Leetcode 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

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)).
You may assume nums1 and nums2 cannot be both empty.

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

class Solution(object):
    def findMedianSortedArrays(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: float
        """
        nums1.extend(nums2)
        nums1.sort()
        num = len(nums1)
        if num % 2 == 1:
            return nums1[ num / 2 ]
        else:
            return (nums1[ (num + 1) / 2 ]  + nums1[ (num - 1) / 2 ])/2.
        

test = Solution()
print test.findMedianSortedArrays([1,3],[2])