One Line Solution in Java


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

Log in to reply
 

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