AcWing 792. 高精度减法

思路：类似高精度加法模拟手算，向判断被减数和减数大小，结果为负数时到过来减，结果加负号即可；

注意：可能会有前置0；去除前置0用循环判断和pop_back();相减时要注意判断是否超过减数的位数；

#include<iostream>
#include<vector>
#include<string>
using namespace std;
bool cmp(vector<int>& a, vector<int>& b)
{
	if (a.size() != b.size())
		return a.size() > b.size();
	for (int i = a.size()-1; i >= 0; i--)//位数相等时从高位到低位逐个比较
	{
		if(a[i]!=b[i])
		return a[i] > b[i];
	}
	return true;
}
vector<int> sub(vector<int>& a, vector<int>& b)
{
	vector<int> c;
	for (int i = 0,t = 0; i < a.size(); i++)
	{
		t += a[i];
		if (i < b.size())//一定要判断
			t -= b[i];
		 c.push_back((t + 10) % 10);
		if (t < 0)
			t = -1;
		else
			t = 0;
	}
	//去除前置0
	while (c.size() > 1 && c.back() == 0)
		c.pop_back();
	return c;
}
int main()
{
	string n, m;
	cin >> n >> m;
	vector<int> a, b;
	for (int i = n.size()-1;i>=0; i--)//倒序存数据 
		a.push_back(n[i] - '0');
	for (int i = m.size() - 1; i >= 0; i--)
		b.push_back(m[i] - '0');
	vector<int> c;
	if (!cmp(a, b))
	{
		cout << "-";
		c = sub(b, a);
	}
	else
		c = sub(a, b);
	for (int i = c.size() - 1; i >= 0; i--)
	{
		cout << c[i];
	}
}