My beautiful java solution


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

Log in to reply
 

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