Merge Sorted Array

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.

LeetCode Problem - 88

import java.util.Arrays;

class Solution {
    // This method merges two sorted arrays into the first array, maintaining sorted order.
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        // Start merging from the end of nums1 and the beginning of nums2.
        for (int i = m, j = 0; i < nums1.length; i++) {
            nums1[i] = nums2[j];
            j++;
        }
        // Sort the merged array to maintain sorted order.
        Arrays.sort(nums1);
    }
}