728x90
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.
"""
nums1[m:m+n] = nums2[:]
nums1.sort()
728x90
'Leetcode' 카테고리의 다른 글
[LeetCode] Symmetric Tree 파이썬 (iterative, recursion) (0) | 2021.03.31 |
---|---|
[LeetCode] Same Tree 파이썬 (TreeNode, recursion) (0) | 2021.03.31 |
[LeetCode] Remove Duplicates from Sorted List 파이썬 (Linked List, shallow copy, deepcopy) (0) | 2021.03.31 |
[LeetCode] Climbing Stairs 파이썬 (DP) (0) | 2021.03.30 |
[LeetCode] Add Binary 파이썬 (int, bin) (0) | 2021.03.30 |
댓글