LeetCode/0004-median-of-two-sorted-arrays/solution.py

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