728x90
4. Median of Two Sorted Arrays
Given two sorted arrays nums1
and nums2
of size m
and n
respectively, return the median of the two sorted arrays.
The overall run time complexity should be O(log (m+n))
.
Examples
1:
Input: nums1 = [1,3], nums2 = [2]
Output: 2.00000
Explanation: merged array = [1,2,3]
and median is 2
.
2:
Input: nums1 = [1,2], nums2 = [3,4]
Output: 2.50000
Explanation: merged array = [1,2,3,4]
and median is (2 + 3) / 2 = 2.5
.
3:
Input: nums1 = [0,0], nums2 = [0,0]
Output: 0.00000
4:
Input: nums1 = [], nums2 = [1]
Output: 1.00000
5:
Input: nums1 = [2], nums2 = []
Output: 2.00000
Constraints:
nums1.length == m
nums2.length == n
0 <= m <= 1000
0 <= n <= 1000
1 <= m + n <= 2000
-10^6 <= nums1[i], nums2[i] <= 10^6
Python solution
import statistics
class Solution:
def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
return statistics.median(nums1 + nums2)
728x90
'알고리즘 > LeetCode' 카테고리의 다른 글
[Python] Longest Palindromic Substring - LeetCode (0) | 2021.09.23 |
---|---|
[Python] Longest Substring Without Repeating Characters - LeetCode (0) | 2021.09.16 |
[Python] Add Two Numbers - LeetCode (0) | 2021.09.16 |
[Python] Two Sum - LeetCode (0) | 2021.09.16 |
댓글