merge sorted array python solution, fast runtime high memory tho lol
class Solution(object):
    def merge(self, nums1, m, nums2, n):
        n = len(nums2)
        if n >= 1:
            del nums1[(-1 * n):]    
			#Deletes the last n elements, eg. from index -3 to the end.
        nums1 += nums2
		#Merges the two lists.
        nums1.sort()
		# Sorts the list in ascending order.
Comments (1)