问题描述:
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.
本题目主要是考虑两个排序数组的合并问题,注意这里给出了每个数组的长度m和n,程序开始时需要将每个数组的长度规范到给定的范围内。
过程详见代码:
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int i = 0;
int j = 0;
nums1.resize(m);
nums2.resize(n);
int index = 0;
while(i < m && j < n)
{
if(nums1[index] <= nums2[j])
{
i++;
}
else
{
nums1.insert(nums1.begin() + index,nums2[j]);
j++;
}
index++;
}
while(j < n)
{
nums1.insert(nums1.begin() + index,nums2[j]);
j++;
index++;
}
}
};