88. Merge Sorted Array
- Total Accepted: 129487
- Total Submissions: 416385
- Difficulty: Easy
- Contributors: Admin
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.
Code
class Solution(object):
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.
"""
p1, p2, pt = m-1, n-1, m+n-1
while p1 >= 0 and p2 >= 0:
if nums2[p2] > nums1[p1]:
nums1[pt] = nums2[p2]
p2 -= 1
else:
nums1[pt] = nums1[p1]
p1 -= 1
pt -=1
# no need to perform this loop. the remaining elements
# of nums1 will be there.
# while p1 >= 0:
# nums1[pt] = nums1[p1]
# pt -= 1
# p1 -= 1
while p2 >= 0:
nums1[pt] = nums2[p2]
pt -= 1
p2 -= 1
Idea
Merge from end to start.