leetcode04

"""
There are two sorted arrays nums1 and nums2 of size m and n respectively.
Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
Example 1:
nums1 = [1, 3]
nums2 = [2]
The median is 2.0
Example 2:
nums1 = [1, 2]
nums2 = [3, 4]
The median is (2 + 3)/2 = 2.5
"""
class (object):
    def findMedianSortedArrays(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: float
        """
        temp = nums1+nums2
        temp = sorted(temp)
        if nums1==[] and nums2==[]:
            return 0
        if(temp.__len__()%2==0):
            return (float)(temp[(int)(temp.__len__()/2-1)] + temp[(int)(temp.__len__()/2)])/2
        else:
            return (float)(temp[(int)(temp.__len__()/2)])
if __name__=='__main__':
    nums1 = [1,2]
    nums2 = [3,4]
    sol = Solution()
    num = sol.findMedianSortedArrays(nums1,nums2)
    print(num)