"""
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.
"""


def merge_sorted(nums1, m, nums2, n):
    nums1[:m + n] = sorted(nums1[:m] + nums2)
    return nums1


def main():
    nums1 = [1, 2, 3, 0, 0, 0]
    m = 3
    nums2 = [2, 5, 6]
    n = 3
    print(f"First array: {nums1}")
    print(f"Second array: {nums2}")
    result = merge_sorted(nums1, m, nums2, n)
    print(f"Sorted array: {result}")


if __name__ == '__main__':
    main()

"""
Output:
First array: [1, 2, 3, 0, 0, 0]
Second array: [2, 5, 6]
Sorted array: [1, 2, 2, 3, 5, 6]
"""

"""
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.
"""


def merge_sorted(nums1, m, nums2, n):
    nums1[:m + n] = sorted(nums1[:m] + nums2)
    return nums1


def main():
    nums1 = [1, 2, 3, 0, 0, 0]
    m = 3
    nums2 = [2, 5, 6]
    n = 3
    print(f"First array: {nums1}")
    print(f"Second array: {nums2}")
    result = merge_sorted(nums1, m, nums2, n)
    print(f"Sorted array: {result}")


if __name__ == '__main__':
    main()

"""
Output:
First array: [1, 2, 3, 0, 0, 0]
Second array: [2, 5, 6]
Sorted array: [1, 2, 2, 3, 5, 6]
"""

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. Output: First array: [1, 2, 3, 0, 0, 0] Second array: [2, 5, 6] Sorted array: [1, 2, 2, 3, 5, 6]