Merge Sorted Array(JAVA)


  • 0
    J

    Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

    Note:
    You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.

    class Solution {
        public void merge(int[] nums1, int m, int[] nums2, int n) {
            if(nums1 == null  || nums2 == null  ||  nums1.length < (m + n ) )
                return;
            
            if(m == 0){
                for(int i=0; i<n; i++)
                    nums1[i] = nums2[i];
                return;
            }
            
            int i = m-1;
            int j = n-1;
            int k = m + n - 1;
           
            while(k>=0){
                if(i>=0 && j>=0){
                    if(nums1[i]<=nums2[j])
                       nums1[k--] = nums2[j--]; 
                   else 
                       nums1[k--] = nums1[i--];
                } else if(i>=0)
                    nums1[k--] = nums1[i--];
                else if(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.