Problem 3 and 4

This commit is contained in:
Simon Oberzier
2026-01-08 22:45:44 +01:00
parent 293fee1fc5
commit 3ebdf3d3b9
2 changed files with 21 additions and 0 deletions

View File

@@ -0,0 +1,5 @@
class Solution:
def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
nums1 = sorted(nums1 + nums2)
length = len(nums1)
return nums1[length//2] if length % 2 == 1 else float(sum(nums1[length//2-1:length//2+1]))/2