大数相加

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

string Addition( string one , string two ) {
    int len1 = one.size ( ) ;
    int len2 = two.size ( ) ;
    string sum ;
    int max ;

    if ( len1 >= len2 )
    {
        sum = one ;
        for( int j = 0 ; j < len2 ; j++ )
        {
            sum[ len1 - j - 1 ] = sum[ len1 - j - 1 ] + ( two [ len2 - j - 1 ] - '0' ) ;
            max = len1 ;
        }
    }
    else
    {    
        sum = two ;
        for( int j = 0 ;j < len1 ; j ++)
        {
            sum[ len2 -  j - 1 ] = sum[ len2 -j -1 ] +( one [ len1 - j - 1 ] - '0' ) ;    
         }
        max = len2;    
        }

    //如果第j位的数大于9，则将其减10，并向上进一位
    for ( int  j = max -1 ; j >= 1 ; j--)
    {
        if( sum[j] > '9' ) {
            sum[ j ] -= 10 ;
            sum[ j - 1 ] ++ ;
        }
    }

    if ( sum[ 0 ] > '9' ) {
        sum [ 0 ]  -= 10 ;
        sum = '1' + sum ;
    }
    return sum ;
}
int main(){
    cout << "两个-大数相加，请输入两个数："<< endl ;
    string first , second ;
    cin >> first >> second ;
    cout << "the result of two number is:" << Addition ( first , second ) << endl ;
	getchar();
    return 0 ;
}

思想：大数超出了计算机的整形表示范围，故一般用字符串记录，两个大数相加就不能简单的用“+”进行运算，得绕个弯。先把字符串转成int数组（借助与字符'0'的差来实现），每位都放在数组中，然后对数组进行按位加。

#include <iostream>
#include <string>
using namespace std;
class ds                                                                                                          
{
public:
	void equal(string x,string y,int n1,int n2);
	void nequal(string x,string y,int n1,int n2);
private :
	string s1,s2;
};
void ds::equal (string s1,string s2,int n1,int n2)
{//两个字符串一样长的时候；
	int flag =0;
	int i;
	int sum =0;
	int k = 0;
	int add[1000];
	for(i=0;i<n1;i++)
	{
		sum = (s1[n1-1-i]-48)+(s2[n1-1-i]-48)+flag;
		if (sum >= 10) 
		{
			sum -= 10;
			flag = 1;
		}
		else
			flag = 0;
		add[i] = sum; 
	}
	if(flag==1)
		add[i++] = flag;//最后加上一位进位；
	for (i--;i>=0;i--)
		cout <<add[i];
}
void ds::nequal(string s1,string s2,int n1,int n2)
{//两个字符串不一样长的时候；
	int flag = 0;
	int i;
	int sum = 0;
	int k = 0;
	int add[1000]; 

	if (n1 < n2) 
	{   
		for(i=0;i<n1;i++)
		{
			sum = (s1[n1-1-i]-48)+(s2[n2-1-i]-48)+flag;
			if (sum >= 10) 
			{
				sum -= 10;
				flag = 1;
			}
			else
				flag = 0;
			add[i] = sum; 
		}
		for(;i<n2;i++)
		{
			sum = s2[n2-1-i]-48 + flag;
			if (sum >= 10)
			{
				sum=0;
				flag = 1;
			}   
			else 
				flag=0;
			add[i]=sum;
		}
		if(flag==1)
			add[i++] = flag;//最后加上一位进位；
		for (i--;i>=0;i--)
			cout <<add[i];
		cout<<endl;
	}
	if (n2 < n1) 
	{   
		for(i=0;i<n2;i++)
		{
			sum = (s2[n2-1-i]-48)+(s1[n1-1-i]-48)+flag;
			if (sum >= 10) 
			{
				sum -= 10;
				flag = 1;
			}
			else
				flag = 0;
			add[i] = sum; 
		}
		for(;i<n1;i++)
		{
			sum = s1[n1-1-i]-48 + flag;
			if (sum >= 10)
			{
				sum=0;
				flag = 1;
			}   
			else 
				flag=0;
			add[i]=sum;
		}
		if(flag==1)
			add[i++] = flag;//最后加上一位进位；
		for (i--;i>=0;i--)
			cout <<add[i];
		cout<<endl;
	}
}

int main()
{
	ds dashu;
	string x1,x2;
	cout<<"please input two word:" <<endl;
	cin >>x1>>x2;
	int n1=x1.length();
	int n2=x2.length();
	if (n1==n2) 
		dashu.equal(x1,x2,n1,n2);
	else
		dashu.nequal(x1,x2,n1,n2);
	getchar();
	return 0;
}