One loop solution, simple


  • 12
    Y
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        while(n>0){
            if(m>0&&nums1[m-1]>nums2[n-1]){
                nums1[m+n-1] = nums1[m-1];
                m--;
            }
            else{
                nums1[m+n-1] = nums2[n-1];
                n--;
            }
        }
    }

  • 1
    J

    Great Solution!! very easy to understand, thanks for sharing!


Log in to reply
 

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