Skip to content

Instantly share code, notes, and snippets.

@mudspringhiker
Last active January 29, 2019 21:25
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save mudspringhiker/a9820d1d20c2a8699cd07e014f6e6805 to your computer and use it in GitHub Desktop.
Save mudspringhiker/a9820d1d20c2a8699cd07e014f6e6805 to your computer and use it in GitHub Desktop.
# Solution for merge_sorted_array.txt
# https://github.com/mudspringhiker/intQuestions/blob/master/merge_sorted_array.md
class Solution:
def merge(self, nums1, m, nums2, n):
"""
:type nums1: List[int]
:type m: int
:type nums2: List[int]
:type n: int
:rtype: void 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] = nums2[n-1]
n -= 1
else:
nums1[m+n-1] = nums1[m-1]
m -= 1
print("n", n)
print("m", m)
if n > 0:
nums1[0:n] = nums2[0:n]
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment