long and clear codes


  • 0
    A
    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.
            """
            i, j = m-1, n-1
            index = m+n-1
            while i >= 0 and j >= 0:
                if nums1[i] >= nums2[j]:
                    nums1[index] = nums1[i]
                    index -= 1
                    i -= 1
                else:
                    nums1[index] = nums2[j]
                    index -= 1
                    j -= 1
            while i >= 0:
                nums1[index] = nums1[i]
                index -= 1
                i -= 1
            while j >= 0:
                nums1[index] = nums2[j]
                index -= 1
                j -= 1
                
                
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.