Leetcode 4.Median of Two Sorted Arrays with Python

class Solution(object):
    def findMedianSortedArrays(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: float
        """
        m = len(nums1)
        n = len(nums2)
        length = m + n
        i = 0
        j = 0
        k = 0
        tar = [0]*length
        while(k<=length-1):
            if j>n-1 or (i <= m-1 and nums1[i]<=nums2[j]):
                if i <= m-1:
                    tar[k]=nums1[i]
                    i += 1  
                    k += 1
            if i>m-1 or (j <= n-1 and nums1[i]>nums2[j] ):
                if j <= n-1:
                    tar[k]=nums2[j]
                    j += 1
                    k += 1
            
        if length%2 == 0:
            print(tar)
            return (tar[length/2]+tar[length/2-1])/2.0
            
        else:
            print(tar)
            return tar[length/2]