feat(content): more test cases
This commit is contained in:
@@ -9,6 +9,24 @@ categories:
|
||||
patterns:
|
||||
- binary-search
|
||||
|
||||
function_signature: "def find_median_sorted_arrays(nums1: list[int], nums2: list[int]) -> float:"
|
||||
|
||||
test_cases:
|
||||
visible:
|
||||
- input: { nums1: [1, 3], nums2: [2] }
|
||||
expected: 2.0
|
||||
- input: { nums1: [1, 2], nums2: [3, 4] }
|
||||
expected: 2.5
|
||||
hidden:
|
||||
- input: { nums1: [], nums2: [1] }
|
||||
expected: 1.0
|
||||
- input: { nums1: [2], nums2: [] }
|
||||
expected: 2.0
|
||||
- input: { nums1: [1, 2, 3], nums2: [4, 5, 6] }
|
||||
expected: 3.5
|
||||
- input: { nums1: [1, 3], nums2: [2, 4] }
|
||||
expected: 2.5
|
||||
|
||||
description: |
|
||||
Given two sorted arrays `nums1` and `nums2` of size `m` and `n` respectively, return **the median** of the two sorted arrays.
|
||||
|
||||
|
||||
Reference in New Issue
Block a user