题解 | #字符串加法#C++暴力遍历字符串加法解法

#include <iostream>
#include <algorithm>
using namespace std;

int main() 
{
    string a;
    string b;
    cin>>a;
    cin>>b;
    int i=0;
    int len1=a.size();
    int len2=b.size();
    int len=max(len1,len2);
    if(len>len1)
    {
        reverse(a.begin(),a.end());
        for(i=len1;i<len;i++)
        {
            a+='0';
        }
        reverse(a.begin(),a.end());
    }
    else
    {
        reverse(b.begin(),b.end());
        for(i=len2;i<len;i++)
        {
            b+='0';
        }
        reverse(b.begin(),b.end());
    }
    string c;
    int count=0;
    for(i=len-1;i>=0;i--)
    {
        int m=a[i]-'0'+b[i]-'0'+count;
        if(m>=2)
        {
            count=1;
        }
        else
        {
            count=0;
        }
        c+=m%2+'0';
    }
    if(count)
    {
        c+=count+'0';
    }
    reverse(c.begin(),c.end());
    cout<<c;
    return 0;
}