Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n){
vector<int> res;
for(int i=0,j=0;i<m||j<n;)
{
if(i==m)
{
res.push_back(nums2[j]);
j++;
}
else if(j==n)
{
res.push_back(nums1[i]);
i++;
}
else if(nums1[i]<nums2[j])
{
res.push_back(nums1[i]);
i++;
}
else
{
res.push_back(nums2[j]);
j++;
}
}
nums1=res;
}
};leetcode No88. Merge Sorted Array
原文：http://blog.csdn.net/u011391629/article/details/52148670