🔍 문제
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.
Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]
Explanation: The arrays we are merging are [1,2,3] and [2,5,6].
The result of the merge is [1,2,2,3,5,6] with the underlined elements coming from nums1.
🖥 실행
1) Answer
class Solution:
def merge(self, nums1: List[int], m: int, nums2: List[int], n: int)
for i in range(1, len(nums1)-m+1):
nums1.pop()
for i in range(1, len(nums2)-n+1):
nums2.pop()
nums1 += nums2
nums1.sort()
return nums1
2) Better Solution
class Solution:
def merge(self, nums1: List[int], m: int, nums2: List[int], n: int)
for i in range(n):
nums1[i + m] = nums2[i]
nums1.sort()
'Coding test > LeetCode' 카테고리의 다른 글
[LeetCode] Height Checker (0) | 2022.05.20 |
---|---|
[LeetCode] Move Zeroes (0) | 2022.05.20 |
[LeetCode] Replace Elements with Greatest Element on Right Side (0) | 2022.05.20 |
[LeetCode] Valid Mountain Array (0) | 2022.05.20 |
[LeetCode] Find Numbers with Even Number of Digits (0) | 2022.05.20 |