题解 | #高精度整数加法#

#include<bits/stdc++.h>
using namespace std;
const int maxn = 10010;
int carry[maxn] = {0};
int res[maxn] = {0};
int main()
{
    string a, b;
    cin >> a >> b;
    int lena = a.length(), lenb = b.length();
    int len = max(lena,lenb);
    int gap = max(lena,lenb)-min(lena,lenb);
    if(lena < lenb){
        for(int i=0;i<gap;i++){a = "0"+a;}
    }else if(lenb<lena)
    {
        for(int i=0;i<gap;i++){b = "0"+b;}
    }
    for(int i = len-1; i >0;i--)
    {
        res[i] = (a[i]-'0') + (b[i]-'0')+carry[i];
        if(res[i] >= 10){
            carry[i-1] = 1;
            res[i] = res[i]%10;
        }else{
            res[i] = res[i]%10;
        }
    }
    res[0] = (a[0]-'0') + (b[0]-'0')+carry[0];
    for(int i=0;i<len;i++)
    {
        cout << res[i];
    }
    return 0;
}