First post on lc


  • 0
    D

    Thanks all for great solutions on so many problems. I learned a lot from your posts. Hope this simple solution can also help some of you!

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

Log in to reply
 

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