LeetCode - 88. Merge Sorted Array (Python)

Easy, Python - List Handling

RunTime : 38 ms / Memory : 16.5 MB

문제

You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.

Merge nums1 and nums2 into a single array sorted in non-decreasing order.

The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n.

풀이

• 어렵진 않았으나 반례를 생각하지 못해 다시 풀었던 문제
• 최근에 회사들 코테를 다 풀어도 떨어진 경우가 있었는데 반례를 생각하는 실력을 키워야 한다.

class Solution:
    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
        tmp = []
        for i in range(m):
            tmp.append(nums1[i])
        tmp.extend(nums2)
        
        for i in range(n + m):
            nums1[i] = tmp[i]
        nums1.sort()