text: class Solution(object):
      def findMedianSortedArrays(self, nums1, nums2):
          """
          :type nums1: List[int]
          :type nums2: List[int]
          :rtype: float
          """
          l = sorted(nums1+nums2)
          a = len(l)
  
          if a%2==0:
              return (l[a/2-1]+l[a/2])/2.0
          else:
              return l[a/2]
  
  
  
  
  
  
      """
          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)).
  
          You may assume nums1 and nums2 cannot be both empty.
  
          Example 1:
  
          nums1 = [1, 3]
          nums2 = [2]
  
          The median is 2.0
  
      """
  