Leetcode 4. Median of Two Sorted Arrays

pythoclass Solution:
    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
        for i in nums2:nums1.append(i)
        nums1.sort()
        chk=len(nums1)
        if chk%2==1 : return nums1[chk//2]
        else: return (nums1[chk//2]+nums1[chk//2-1])/2