Clean python code


  • 1
    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]

Log in to reply
 

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