Merge sorted array

Array Two Pointers Sorting

54.4% acceptance

Jan 12, 2026

18754

2628

You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n.

Solution

Rust

Time O(n)

Space O(1)

LeetCode

solution.rs

impl Solution {
  pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
    let mut i = m as i32 - 1;
    let mut j = n as i32 - 1;
    let mut k = (m + n) as i32 - 1;
    
    while j >= 0 {
      if i >= 0 && nums1[i as usize] > nums2[j as usize] {
        nums1[k as usize] = nums1[i as usize];
        i -= 1;
      } else {
        nums1[k as usize] = nums2[j as usize];
        j -= 1;
      }
      k -= 1;
    }
  }
}