88.py

#88
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: 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
        ''' Here we need to consider two cases of (m=0,n>0) and (m>0 and n=0)
            intialization. If n=0 we need not do anything,
            if m=0 and n>0, then we need to add the elements of second list
            in first.
        '''
        
        if m == 0:
            nums1[:n] = nums2[:n]