从后往前合并两个有序数组

#include <iostream>
#include<string>
#include<vector>
using namespace std;
void Verge(vector<int>& a, vector<int>& b)
{
if (a.empty())
a = b;

if (b.empty())
return;
typedef vector<int>::reverse_iterator Iter;
Iter itera = a.rbegin(),iterb=b.rbegin();
int lena = a.size();
a.resize(a.size() + b.size(), 0);
Iter newitera = a.rbegin();
int i = lena - 1;
while (i>=0&&iterb != b.rend())
{
if (*iterb >= a[i])
{
*newitera = *iterb;
iterb++;
newitera++;
}
else
{
*newitera = a[i];
i--;
newitera++;
}
}
if (iterb != b.rend())
{
while (iterb != b.rend()){
*newitera = *iterb;
newitera++;
iterb++;
}
}
return;
}
int main()
{
int ai[] = { 1, 3, 4, 5, 8 };
int bi[] = { 1, 2, 5, 6, 7, 9 };
vector<int> veca(ai, ai + 5);
vector<int> vecb(bi, bi +6);
Verge(veca, vecb);
for (vector<int>::iterator iter = veca.begin();
iter != veca.end(); iter++)
{
cout << *iter << '\t';
}
return 0;
}