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
def get_median(num1,num2):
result= []
i= 0
j = 0
k = 0
print(len(num1)+len(num2))
while i <len(num1) and j <len(num2):
if num1[i] < num2[j]:
result.append(num1[i])
i = i+1
else:
result.append(num2[j])
j = j+1
k = k +1
print(k)
result.extend(num1[i:])
result.extend(num2[j:])
return result
if __name__ == "__main__":
print(get_median([1,3,5,7],[2,4,6,8]))
网友评论