Leetcode 88. Merge Sorted Array

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.
        """
        for i in range(len(nums1)-m): nums1.pop()
        for i in range(n):
            nums1.append(nums2[i])
        nums1.sort()