高精度加法

如下，是加法的方法。 

#include<string>
#include<vector>
#include<algorithm>
#include<iostream>
using namespace std;

template <class T>
void reverse(T& s)
{
	int begin = 0;
	int end = s.size() - 1;
		while (begin < end)
		{
			swap(s[begin++], s[end--]);
		}
}
int  atoi(char ch)
{
	return ch - '0';
}
void  my_main(string &num1, string &num2)
{
	vector<int> ret;
	if (num1.size() == 0 || num1[0] == '0')
	{
		for (auto e : num2)
		{
			cout << e;

		}
		return;
	}
	if (num2.size() == 0 || num2[0] == '0')
	{
		for (auto e : num1)
		{
			cout << e;
		}
		return;
	}
	reverse(num1), reverse(num2);
	int i = 0, j = 0, temp = 0;
	int len1 = num1.size();
	int len2 = num2.size();
	ret.reserve(std::max(len1, len2) + 1);
	int carry = 0;
	for (; i < len1 || j < len2; i++, j+