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这个数组的长度是m+n。我的考虑是,比较之后插入,如果插入就把插入处之后的往后依次挪一个。这个算法通过了。
public void merge(int[] nums1, int m, int[] nums2, int n) {
int i = 0, j = 0;
while (i < m && j < n) {