Merge two sorted int arrays

class Solution:
    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
        """
        Do not return anything, modify nums1 in-place instead.
        """
        
        mid_idx = len(nums1)  - len(nums2)
        
        for i in range(len(nums1)):
            if i >= mid_idx:
                nums1[i] = nums2[i - mid_idx]
                
        nums1.sort()