LeetCode-Array-88. Merge Sorted Array

**问题：**Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equal to m + n)
to hold additional elements from nums2. The number of elements initialized
in nums1 and nums2 are m and n respectively.
**思考：**nums1中有足够大的空间，从后往前比较nums1和nums2中的值，将它放在k=m+n-1的位置上，遍历，谁大就放在k上，并减小k。
代码：