':type nums1: List[int]
:type nums2: List[int]
:rtype: float'

def findMedianSortedArrays(self, nums1, nums2):

    (len1, len2) = (len(nums1), len(nums2))
    if (((len1 + len2) % 2) == 1):
        return self.getKth(nums1, nums2, (((len1 + len2) / 2) + 1))
    else:
        return ((self.getKth(nums1, nums2, ((len1 + len2) / 2)) + self.getKth(nums1, nums2, (((len1 + len2) / 2) + 1))) * 0.5)
