Java 5 Lines Perfect Solution


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

Log in to reply
 

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