题目:两个有序数组nums1和nums2,将其合并并求中位数,要求算法复杂度为log级别
class Solution:
def findMedianSortedArrays(self,nums1,nums2)->list:
for i in range(len(nums1)):
nums2.append(nums1[i])
nums2.sort()
n=len(nums2)
if n%2==0:
return (nums2[n//2-1] + nums2[n//2])/2
else:
return nums2[n//2]
a=[1,2,3]
b=[4,5,6,7]
c = Solution()
print(c.findMedianSortedArrays(a,b))