【算法】对于大数的操作

1.大数相加

void Add(string& s1, string& s2)
{
	int len1 = s1.size();
	int len2 = s2.size();
	string ret;   //保存结果
	reverse(s1.begin(), s1.end());     //反转以后比较好算
	reverse(s2.begin(), s2.end());
	int n = len1 > len2 ? len1 : len2;
	int val = 0, count = 0,temp1,temp2;
	for (size_t i = 0; i < n; ++i)
	{
		if (i < len1)
			temp1 = s1[i] - '0';
		else
			temp1 = 0;
		if (i < len2)
			temp2 = s2[i] - '0';
		else
			temp2 = 0;
		val = (temp1 + temp2 + count) % 10;  //每一位的和
	    count = (temp1 + temp2 + count) / 10;       //count = 1;  加法中进位不会超过1
		ret.insert(ret.begin(),val + '0');
	}
	if (count == 1)
		ret.insert(ret.begin(), '1');
	cout << ret << endl;
}

2.大数相乘

• 核心算法就是 ret[i + j] += v1[i] * v2[j]  将没两个数相乘的结果保存

• 注意：储存是反过来存储的，在最后打印的时候要去掉前边的0

void Mul(string& s1, string& s2)
{
	int len1 = s1.size();
	int len2 = s2.size();
	int len = len1 + len2;
	vector<int> v1(len1,0);
	vector<int> v2(len2,0);
	vector<int> ret(len,0);
	int count = 0;
	for (size_t i = 0; i < len1; ++i)
	{
		v1[i] = s1[i] - '0';
	}
	for (size_t i = 0; i < len2; ++i)
	{
		v2[i] = s2[i] - '0';
	}

	for (int i = 0; i < len1; ++i)
	{
		for (int j = 0; j < len2; ++j)
		{
			ret[i + j] += (v1[i] * v2[j]);
	}
	}
	
	reverse(ret.begin(), ret.end());
	for (int i = len - 1; i >= 0; --i)
	{
		int temp = ret[i];
		ret[i] = ((ret[i] + count) % 10);
		count = (temp + count) / 10;
	}
	
	/*
	for (int i = 0; i < len; i++)
	{
		if (ret[i] > 9)
		{
			ret[i + 1] += ret[i] / 10;
			ret[i] %= 10;
		}
	}
	reverse(ret.begin(), ret.end());
	*/
	for (auto& e : ret)
	{
		if (e == 0)
		{
			++count;
			continue;
		}
		else
			break;
	}
	for (count; count < len; ++count)
		cout << ret[count];
}