1. 问题描述:
2. 解决办法:
class Solution:
def findMedianSortedArrays(self, nums1, nums2):
"""
:type nums1: List[int]
:type nums2: List[int]
:rtype: float
"""
m, n = len(nums1), len(nums2)
num1_index, num2_index = 0, 0
sort = []
while (m and n):
if nums1[num1_index] < nums2[num2_index]:
sort += [nums1[num1_index]]
num1_index += 1
m -= 1
elif nums1[num1_index] > nums2[num2_index]:
sort += [nums2[num2_index]]
num2_index += 1
n -= 1
else:
sort += [nums1[num1_index], nums2[num2_index]]
num2_index += 1
num1_index += 1
m -= 1
n -= 1
while num1_index < len(nums1):
sort += [nums1[num1_index]]
num1_index += 1
while num2_index < len(nums2):
sort += [nums2[num2_index]]
num2_index += 1
quotient, left = divmod(len(sort), 2)
if left == 0:
median = (sort[quotient - left] + sort[quotient]) / 2.0
else:
median = sort[quotient] * 1.0
return median
3. 个人记录:
(1)这本质是一个排序问题,上面的方法算是最先想到的,但是需要注意的是,对于这种长度不确定的, while判断时用与操作反而方便,否则在内部还需要添加很多判断。