Cleanest Java solution


  • 1
    H
    class Solution {
        public void merge(int[] nums1, int m, int[] nums2, int n) {
            for (int i = m + n - 1; i >= 0; i--) {
                if (m == 0)                             nums1[i] = nums2[--n];
                else if (n == 0)                        nums1[i] = nums1[--m];
                else if (nums1[m - 1] > nums2[n - 1])   nums1[i] = nums1[--m];
                else                                    nums1[i] = nums2[--n];
            }
        }
    }
    

Log in to reply
 

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