Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
- The number of elements initialized in nums1 and nums2 are m and n respectively.
- You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.
Example:
Input: nums1 = [1,2,3,0,0,0], m = 3 nums2 = [2,5,6], n = 3 Output: [1,2,2,3,5,6]
题解:就是不用额外空间把一个数组归并另一个数组,由于保证了nums1数组的空间足够,所以可以从尾部开始构造nums1数组这样就不用移位了,因为如果提前遍历完B数组剩下的A数组是递增的不用动如果提前遍历完A数组则只需遍历一遍剩下B数组即可,用一行可以解决:while(n>0) nums1[n+m-1]=m>0&&nums1[m-1]>nums2[n-1]?nums1[--m]:nums2[--n];
这里是用正常的归并思路:
class Solution {
public:
void merge(int A[], int m, int B[], int n) {
int i=m-1,j=n-1,tar=n+m-1;
while(i>=0&&j>=0){
if(A[i]>B[j]) A[tar--]=A[i--];
else A[tar--]=B[j--];
}
while(j>=0){
A[tar--]=B[j--];
}
}
};