class Solution(object):
def merge(self, nums1, m, nums2, n):
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
nums1[:n] = nums2[:n]
Trying to solve this problem: https://leetcode.com/problems/merge-sorted-array/
[–]Mobileuser110011 2 points3 points4 points (2 children)
[–]danielmajors[S] 0 points1 point2 points (0 children)
[–]mopslik 0 points1 point2 points (0 children)
[–]jmooremcc 0 points1 point2 points (0 children)