栈实现大整数求和

来自C++数据结构与算法（第4版）第四章。

#include <iostream>
#include <stack>
#include <vector>
using namespace std;
stack<int> addLargeNumbers(const vector<int> &v1, const vector<int> &v2)
{
stack<int> s1;
stack<int> s2;
stack<int> result;
int Carry = 0;
for (auto i : v1)
{
s1.push(i);
}
for (auto i : v2)
{
s2.push(i);
}
while (!s1.empty() || !s2.empty())
{
int a, b, tmp;
if (!s1.empty() && !s2.empty())
{
a = s1.top();
b = s2.top();
tmp = a + b + Carry;
s1.pop();
s2.pop();
result.push(tmp % 10);
Carry = tmp / 10;
}
else if (!s1.empty() && s2.empty())
{
while (!s1.empty())
{
a = s1.top();
tmp = a + Carry;
s1.pop();
result.push(tmp % 10);
Carry = tmp / 10;
}
}
else if (!s2.empty() && s1.empty())
{
while (!s2.empty())
{
a = s2.top();
tmp = a + Carry;
s2.pop();
result.push(tmp % 10);
Carry = tmp / 10;
}
}
}
return result;
}
int main()
{
vector<int> v1{ 5, 9, 2 };
vector<int> v2{ 3, 7, 8, 4 };
stack<int> s;
s = addLargeNumbers(v1, v2);
while (!s.empty())
{
int tmp = s.top();
cout << tmp;
s.pop();
}
}