Simple Python Solution


  • 1
    Y
    def merge(self, nums1, m, nums2, n):
        
           
            i = m-1
            j = n-1
            k = m+n-1
            
            while(i >= 0 and j >= 0):
                if nums1[i] > nums2[j]:
                    nums1[k] = nums1[i]
                    k -= 1
                    i -= 1
                else:
                    nums1[k] = nums2[j]
                    k -= 1
                    j -= 1
            while(j >= 0):
                nums1[k] = nums2[j]
                k -= 1
                j -= 1

Log in to reply
 

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