Clean Java code


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

Log in to reply
 

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