Leetcode 88. Merge Sorted Array

Given two sorted arrays nums1 and nums2 and counts m and n (nums1 has length m+n with its last n slots free), merge the elements into nums1 in non-decreasing order in-place. Aim for an O(m + n) solution that uses the available buffer rather than returning a new array.