先来看题目描述:
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.
有两个已经排好序的数组,找出来这两个数组中的中位数,整体的运行时间应该在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
我的想法很简单,就是先合并然后再求解中位数,使用的python3.5
代码如下:
class Solution: def findMedianSortedArrays(self ,nums1, nums2): list1 = [] list1 =nums1 + nums2 list1.sort() return (list1[len(list1)//2]+list1[len(list1)//2 -1])/2 if len(list1)%2==0 else list1[len(list1)//2]
时间复杂度应该是O(1),因为我的数组加在一起排序是提前完成的,而且返回下标这是常数时间。谢谢!