刷题 Median of Two Sorted Arrays

https://leetcode.com/problems/median-of-two-sorted-arrays/

刷题

class Solution(object):
    def findMedianSortedArrays(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: float
        """
        m = len(nums1)
        n = len(nums2)
        if m==0:
          if n&0x1==1:
            return nums2[(n)/2]
          else:
            #print nums2[(n)/2], nums2[(n)/2-1]
            return (nums2[(n)/2]+ nums2[(n)/2-1])*0.5
        if n==0:
          if m&0x1==1:
            return nums1[(m)/2]
          else:
            return (nums1[(m)/2]+ nums1[(m)/2-1])*0.5
        lmax = 0
        rmin = 0
        j = 0
        for i in range(m+1):

          j = (m+n+1)/2-i
          #print 'i=',i,',j=',j
          if j>n or j<0:
            continue

          if i==0 :
            lmax = nums2[j-1]
          elif j==0 :
            lmax = nums1[i-1]
          else:
            lmax = max(nums1[i-1],nums2[j-1])

          if i==m :
            rmin = nums2[j]
          elif j==n :
            rmin = nums1[i]
          else:
            rmin = min(nums1[i],nums2[j])
        
          if lmax<=rmin:
             #print [i,j, lmax,rmin]
             if (m+n)&0x1==1:
               return lmax
             else:
               return (lmax+rmin)/2.0