1. STL容器string中数组的倒置 reverse(it1,it1);
2. - 48,0的ASCII码为48
3. 用最长的数组的长度为基准,让两个值相加,记得进位和(%10为剩下的值,/10为进下一位的值)
#include<iostream>
using namespace std;
int main()
{
int n,m;
while(cin>>n>>m)
{
cout<<n+m<<endl;
}
return 0;
}
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
int vec1[100002];
int vec2[100002];
int vec[100002];
int main(){
string s1;
string s2;
while(cin>>s1 && cin>>s2)
{
string s3=s1;
string s4=s2;
memset(vec1,0,sizeof(vec1));
memset(vec2,0,sizeof(vec2));
memset(vec,0,sizeof(vec));
reverse(s1.begin(),s1.end());
reverse(s2.begin(),s2.end());
int l1=s1.length();
int l2=s2.length();
for(int i=0;i<l1;i++){
vec1[i]=s1[i]-48;
}
for(int i=0;i<l2;i++){
vec2[i]=s2[i]-48;
}
int l= l1>l2? l1: l2;
int nex=0;
for(int i=0;i<l;i++){
int ans=vec1[i]+vec2[i]+nex;
vec[i]=ans%10;
nex=ans/10;
}
if(nex!=0){
vec[l++]=nex;
}
for(int i=l-1;i>=0;i--){
cout<<vec[i];
}
cout<<endl;
}
return 0;
}