高精度加法

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int a[N],b[N],c[N];
int k,j,pos,temp;
int main(){
	string s1,s2;
	cin>>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++){
		temp += a[i]+b[i];
		c[i] = temp%10;
		if(temp>=10) temp = 1;
		else temp = 0;
	}
	if(temp!=0)c[++maxn] = temp;
	for(int i = maxn;i>=1;i--)cout<<c[i];
}

791. 高精度加法 - AcWing题库