Java: Merge Sorted Arrays

Difficulty Level: EASY

Problem Statement:

Given two sorted 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 `nums2` into `nums1` as one sorted array.

Input:

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

Output:

[1,2,2,3,5,6]  //Merge Array should be Sorted.