高精度减法

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int a[N],b[N],c[N];
string s1,s2;
int j,k;
bool cmp(string s1,string s2){
	if(s1.length()!=s2.length())return s1.length()>s2.length();
	else{
		for(int i = 0;i<=s1.length()-1;i++){
			if(s1[i]!=s2[i])return s1[i]>s2[i];
		}
	}
	return true;
}
int main(){
	cin>>s1>>s2;
	if(cmp(s1,s2)==false){
		cout<<"-";
		swap(s1,s2);
	}
	for(int i = s1.length()-1;i>=0;i--)a[++k] = s1[i]-'0';
	for(int i = s2.length()-1;i>=0;i--)b[++j] = s2[i]-'0';
	int maxn = max(s1.length(),s2.length());
	for(int i = 1;i<=maxn;i++){
		if(a[i]-b[i]>=0)c[i] = a[i]-b[i];
		else{
			a[i+1] -= 1;
			c[i] = a[i]-b[i]+10;
		}
	}
	while(c[maxn]==0&&maxn>1)maxn--;
	for(int i = maxn;i>=1;i--)cout<<c[i];
}

792. 高精度减法 - AcWing题库