华为机试——超大整数加法运算

思想：大整数应该用字符串或者数组来存储，不过注意低位存在字符的最前面，高位存后面

#include<iostream>
#include<cstring>
const int N=100;
using namespace std;

void SumOfBigInt(char a[],char b[])
{
    int len1,len2,len,i;
    len1=strlen(a);
    len2=strlen(b);
    int s1[N]={0};
    int s2[N]={0};
    for(i=0;i<len1;i++)
        s1[i]=a[len1-1-i]-'0';  //将char型字符转换成int型
    for(i=0;i<len2;i++)
        s2[i]=b[len2-1-i]-'0';
    len=(len1>len2)? len1:len2;
    for(i=0;i<len;i++)
    {
        s1[i]=s1[i]+s2[i];
        s1[i+1]=s1[i+1]+s1[i]/10;
        s1[i]=s1[i]%10;
    }
    if(s1[len]!=0)
        cout<<s1[len];
    for(i=len-1;i>=0;i--)
        cout<<s1[i];

}

int main()
{
    char a[N],b[N];
    cin.getline(a,N);
    cin.getline(b,N);
    SumOfBigInt(a,b);

}