def findMedianSortedArrays(self, nums1, nums2):
    '\n        :type nums1: List[int]\n        :type nums2: List[int]\n        :rtype: float\n        '
    odd = ((len(nums1) + len(nums2)) % 2)
    if odd:
        half = ((len(nums1) + len(nums2)) // 2)
    else:
        half = (((len(nums1) + len(nums2)) // 2) - 1)
    for _ in range(half):
        __ = self.pop_num(nums1, nums2)
    if odd:
        return float(self.pop_num(nums1, nums2))
    else:
        t1 = self.pop_num(nums1, nums2)
        t2 = self.pop_num(nums1, nums2)
        return ((t1 + t2) / 2)
:type nums1: List[int]
:type nums2: List[int]
:rtype: float
def findMedianSortedArrays(self, nums1, nums2):
    '\n        :type nums1: List[int]\n        :type nums2: List[int]\n        :rtype: float\n        '
    odd = ((len(nums1) + len(nums2)) % 2)
    if odd:
        half = ((len(nums1) + len(nums2)) // 2)
    else:
        half = (((len(nums1) + len(nums2)) // 2) - 1)
    for _ in range(half):
        __ = self.pop_num(nums1, nums2)
    if odd:
        return float(self.pop_num(nums1, nums2))
    else:
        t1 = self.pop_num(nums1, nums2)
        t2 = self.pop_num(nums1, nums2)
        return ((t1 + t2) / 2)