0088.Merge sorted array

public class MergeSortedArray {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int index = m + n - 1; // Start from the end of the merged array
        
        // Decrement the indices of the input arrays to start comparing from the largest elements
        m--;
        n--;
        
        // Continue merging until all elements from the second array are merged into the first array
        while (n >= 0) {
            if (m >= 0 && nums1[m] > nums2[n]) {
                nums1[index] = nums1[m]; // Copy the larger element from the first array
                m--;
            } else {
                nums1[index] = nums2[n]; // Copy the larger element from the second array
                n--;
            }
            index--;
        }
    }

    public static void main(String[] args) {
        MergeSortedArray merger = new MergeSortedArray();
        int[] nums1 = new int[]{1, 2, 3, 0, 0, 0};
        int m = 3;
        int[] nums2 = new int[]{2, 5, 6};
        int n = 3;

        merger.merge(nums1, m, nums2, n);

        // Print the merged array
        for (int num : nums1) {
            System.out.print(num + " ");
        }
    }
}