Method findMedianSortedArrays

Array/MedianOfTwoSorted.py:66–108

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

(self, nums1, nums2)

class Solution(object):

    def findMedianSortedArrays(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: float
        """
        
        length = len(nums1) + len(nums2)
        if length <= 2:
            return sum(nums1+nums2) / length 
        raw_length = length
        
        length = length // 2

        if raw_length % 2 != 0:
            length += 1
            
        while length > 1:

            reduce_value = length // 2
            if nums1:
                if reduce_value > len(nums1):
                    reduce_value = len(nums1)
            if nums2:
                if reduce_value > len(nums2):
                    reduce_value = len(nums2)
                
            nums1_k_value = nums1[reduce_value-1] if nums1 else float('inf')
            nums2_k_value = nums2[reduce_value-1] if nums2 else float('inf')

            if nums1_k_value < nums2_k_value:
                nums1 = nums1[reduce_value:]
            else:
                nums2 = nums2[reduce_value:]

            length -= reduce_value


        result = sorted(nums1[:2] + nums2[:2])
        if raw_length % 2 != 0:
            return result[0]

        return sum(result[:2]) / 2 
                

    # def findMedianSortedArrays(self, nums1, nums2):