top of page
Search

Merge Sorted Array

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

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



Example 1:

Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]

Example 2:

Input: nums1 = [1], m = 1, nums2 = [], n = 0
Output: [1]

Constraints:

  • 0 <= n, m <= 200

  • 1 <= n + m <= 200

  • nums1.length == m + n

  • nums2.length == n

  • -109 <= nums1[i], nums2[i] <= 109


Solution:


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


15 views0 comments

Recent Posts

See All

Smallest String With A Given Numeric Value

The numeric value of a lowercase character is defined as its position (1-indexed) in the alphabet, so the numeric value of a is 1, the numeric value of b is 2, the numeric value of c is 3, and so on.

コメント


bottom of page