|
1 | 1 | class Solution: |
2 | 2 | def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float: |
3 | | - nums3 = nums1 + nums2 |
4 | | - nums3.sort() |
| 3 | + nums1.extend(nums2) |
| 4 | + nums1 = sorted(nums1) |
| 5 | + median = abs(len(nums1) / 2) |
| 6 | + if len(nums1) % 2 == 0: |
| 7 | + return (nums1[int(median)] + nums1[int(median-1)]) / 2 |
| 8 | + return nums1[int(median)] |
5 | 9 |
|
6 | | - if len(nums3) %2 == 1: |
7 | | - return nums3[((len(nums3)+1)//2)-1] |
8 | | - else: |
9 | | - return (nums3[(len(nums3)//2)-1]+nums3[(len(nums3)+1)//2])/2 |
| 10 | +# 1st solution |
| 11 | +# nums3 = nums1 + nums2 |
| 12 | +# nums3.sort() |
| 13 | + |
| 14 | +# if len(nums3) %2 == 1: |
| 15 | +# return nums3[((len(nums3)+1)//2)-1] |
| 16 | +# else: |
| 17 | +# return (nums3[(len(nums3)//2)-1]+nums3[(len(nums3)+1)//2])/2 |
| 18 | + |
10 | 19 |
|
0 commit comments