【leetcode】4. Median of Two Sorted Arrays寻找两个有序数组的中位数

class Solution:
    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
        newList = nums1 + nums2
        newList.sort()
        result = 0
        if(len(newList)%2 != 0) :
            result = newList[math.ceil(len(newList)/2-1)]
        else:
            index = int(len(newList)/2)
            result = (newList[index] + newList[index-1])/2
        return result