Merge Sorted Array


  • 0
    R
            int i = m-1;
            int j= n-1;
            int k = m+n-1;
            
            while(k>=0){
                
                if (j < 0 || (i >= 0 && nums1[i] > nums2[j]))
    			nums1[k--] = nums1[i--];
    		else
    			nums1[k--] = nums2[j--];
            }
            
        }
    

Log in to reply
 

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