Java easy to understand solution.


  • 8
    C
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int i = m-1, j = n-1, k = m+n-1;
        while (i>=0 && j>=0) {
             nums1[k--] = nums1[i]>nums2[j]?nums1[i--]:nums2[j--];
        }
        while (i==-1 && j>=0) 
            nums1[j] = nums2[j--];
    }

  • 0
    L
    while (i==-1 && j>=0)
    

    I think i == -1 is not neccessary, although the solution is concise. :)


Log in to reply
 

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