Median of Two Sorted Arrays

class Solution(object):
    def findMedianSortedArrays(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: float
        ：使用合并排序算法
        """
        l = 0
        r = 0
        result = []
        while l<len(nums1) and r<len(nums2):
            if nums1[l]<nums2[r]:
                result.append(nums1[l])
                l += 1
            else:
                result.append(nums2[r])
                r += 1
        if l==len(nums1):
            result += nums2[r:]
        if r==len(nums2):
            result += nums1[l:]
        length = len(result)
        if length%2==0:
            print result[length/2]
            print result[length/2-1]
            return float(result[length/2]+result[(length/2)-1])/2
        else:
            return result[length/2]