题目: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.
Subscribe to see which companies asked this question
想法:合并两个有序的数组。数组的操作比链表容易,直接对应位置比较,大的替换,长度结束后做判断,剩下的全部插入即可
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int pos=m+n-1,i=m-1,j=n-1;
while(i>=0&&j>=0)
nums1[pos--]=nums1[i]>nums2[j]?nums1[i--]:nums2[j--];
while(i>=0)
nums1[pos--]=nums1[i--];
while(j>=0)
nums1[pos--]=nums2[j--];
}
};