LeetCode 笔记三 寻找中位数

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

Example

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

Code

这个题放在困难的等级，但如果用python来做，真的是相当简单了。不过LeetCode上感觉用C或者Java写会好些吧。但我的C已经忘得有点尴尬了，还是继续用Python先写着吧。

class Solution:
    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
        nums3 = nums1 + nums2
        nums3.sort()
        n = len(nums3)
        if n % 2 == 0:
            return (nums3[n//2] + nums3[n//2 - 1])/2
        else:
            return nums3[n//2]

看，Python写是不是超级简单明了，直接提交结果：

2085 / 2085 test cases passed.
Runtime: 88 ms
Memory Usage: 14 MB

Runtime: 88 ms, faster than 99.92% of Python3 online submissions for Median of Two Sorted Arrays.
Memory Usage: 14 MB, less than 5.71% of Python3 online submissions for Median of Two Sorted Arrays