大数相加之我见

//本例实现正整数的大数相加

#include<iostream>

#include<string>
using namespace std;
//-------------------------
//全局变量
string s1,s2;
int m[1002], n[1002];
//-------------------------
int convert(string s1,string s2){ //将接收到的字符串转换为整形数组中的数值
int length = s1.size()>s2.size()?s1.size():s2.size();//获得两个字符串中较长的长度
int j = 0;
for(int i = s1.size()-1; i>=0; i--) m[j++] = s1[i] - '0';
j = 0;
for(int i = s2.size()-1; i>=0; i--) n[j++] = s2[i] - '0';
return length;
}
//-------------------------
int main(int argc, char argv[]){
while(cin>>s1>>s2){
memset(m,0,sizeof(m));
memset(n,0,sizeof(n));
int length = convert(s1,s2);
bool c = false; //用于最后判断是否全为0
for(int i = 0; i<length; i++){
m[i] += n[i];
if(m[i]>9){
m[i+1] += m[i]/10;
m[i] = m[i]%10;
}
if(i==length-1 && m[i+1]!=0) length++;
}
for(int i = length-1; i>=0; i--)
if(m[i]!=0)
while(i>=0){
cout<<m[i];
i--;
c = true;
}
if(c==false) cout<<0;
cout<<endl;
}
return 0;

}

//请不吝赐教~~~~