-
-
Notifications
You must be signed in to change notification settings - Fork 46.6k
/
Copy pathmedian_two_array.py
48 lines (37 loc) · 1.35 KB
/
median_two_array.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
class Solution:
def find_median_sorted_arrays(self, nums1: list[int], nums2: list[int]) -> float:
"""
Find the median of two sorted arrays.
Args:
nums1: The first sorted array.
nums2: The second sorted array.
Returns:
The median of the two sorted arrays.
Example:
>>> sol = Solution()
>>> sol.find_median_sorted_arrays([1, 3], [2])
2.0
>>> sol.find_median_sorted_arrays([1, 2], [3, 4])
2.5
>>> sol.find_median_sorted_arrays([0, 0], [0, 0])
0.0
"""
# Merge the arrays into a single sorted array.
merged = nums1 + nums2
# Sort the merged array.
merged.sort()
# Calculate the total number of elements in the merged array.
total = len(merged)
if total % 2 == 1:
# If the total number of elements is odd, return the
# middle element as the median.
return float(merged[total // 2])
else:
# If the total number of elements is even, calculate
# the average of the two middle elements as the median.
middle1 = merged[total // 2 - 1]
middle2 = merged[total // 2]
return (float(middle1) + float(middle2)) / 2.0
if __name__ == "__main__":
import doctest
doctest.testmod()