Skip to content

Commit

Permalink
Create: 88-Merge-Sorted-Array.py
Browse files Browse the repository at this point in the history
  • Loading branch information
ingrid-liu committed Nov 22, 2022
1 parent c17e82c commit 57646bf
Showing 1 changed file with 14 additions and 0 deletions.
14 changes: 14 additions & 0 deletions python/88.Merge-Sorted-Array.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
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.
"""
while m > 0 and n > 0:
if nums1[m-1] >= nums2[n-1]:
nums1[m+n-1] = nums1[m-1]
m -= 1
else:
nums1[m+n-1] = nums2[n-1]
n -= 1
if n > 0:
nums1[:n] = nums2[:n]

0 comments on commit 57646bf

Please sign in to comment.