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.
public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int index = m+n-1;
int ai = m-1;
int bi = n-1;
for(;index>=0;index--)
{
if(ai>=0&&(bi<0||nums1[ai]>nums2[bi]))
nums1[index] = nums1[ai--];
else
nums1[index] = nums2[bi--];
}
}
}
这个不知道怎么编写测试数据,因为第一个数组自己编写相当于是固定长度,并没有动态增加内容,所以直接提交就过了