Leetcode #4

最新推荐文章于 2021-09-30 09:56:34 发布

wlllssd

最新推荐文章于 2021-09-30 09:56:34 发布

阅读量118

点赞数

分类专栏： python学习

本文链接：https://blog.csdn.net/wlllssd/article/details/80153219

版权

python学习专栏收录该内容

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

思路：

两个列表相加排序后输出中位数

代码：

class Solution:
    def findMedianSortedArrays(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: float
        """
        size = len(nums1) + len(nums2)
        nums3 = sorted(nums1+nums2)
        if(size % 2 ==0):
        	return float(float(nums3[size//2-1]+nums3[size//2])/2)
        else:
        	return float(nums3[size//2])