2015华为机试练习-超长正整数相加

最新推荐文章于 2020-08-20 22:04:58 发布

codenupt

最新推荐文章于 2020-08-20 22:04:58 发布

阅读量992

点赞数

分类专栏：编程刷题

本文链接：https://blog.csdn.net/u012577585/article/details/47185427

版权

编程刷题专栏收录该内容

28 篇文章 0 订阅

订阅专栏

#include<iostream>
using namespace std;
#include<string>
const int N=65536;
char*Addequal(char add1[],char add2[],int len1,int len2)
{
	char *res=new char[len1];
	int flag=0;
	for (int i=len1-1,j=0;i>=0;i--,j++)
	{
		int a1=add1[i]-'0';
		int a2=add2[i]-'0';
		if (a1+a2>=10)
		{
			if(i>0)
			{
				add1[i-1]=char(add1[i-1]+1);
				res[j]=char(a1+a2-10+'0');
			}
			else
			{
				res[j]=char(a1+a2-10+'0');
				res[j+1]='1';
				flag=1;
			}
		}
		else
		{
			res[j]=char(a1+a2+'0');
		}
	}
	if (flag==1)
	{
		res[len1+1]='\0';
	}
	else
	{
		res[len1]='\0';
	}
	int len=strlen(res);
	int count=len;
	char*res1=new char[len];
	for (int l=0;l<len;l++)
	{
		res1[l]=res[count-1];
		count--;
	}
	res1[len]='\0';
	return res1;
}
char*AddGreat(char add1[],char add2[],int len1,int len2)
{
	char*res=new char[len1+1];
	int j=0;
	int flag=0;
	for (int i=len2-1,i1=len1-1;i>=0;i--,j++,i1--)
	{
		int a1=add1[i1]-'0';
		int a2=add2[i]-'0';
		if (a1+a2>=10)
		{
			add1[i1-1]=char(add1[i1-1]+1);
			res[j]=char(a1+a2-10+'0');
		}
		else
		{
			res[j]=char(a1+a2+'0');
		}
	}
	for (int k=len1-len2-1;k>=0;k--,j++)
	{
		int a1=add1[k]-'0';
		if (a1>=10)
		{
			if (k>0)
			{
				add1[k-1]=char(add1[k-1]+1);
				res[j]=char(a1-10+'0');
			}
			else
			{
				res[j]=char(a1-10+'0');
				res[j+1]='1';
				flag=1;
			}
		}
		else
		{
			res[j]=char(a1+'0');
		}
	}
	if (flag==1)
	{
		res[len1+1]='\0';
	}
	else
	{
		res[len1]='\0';
	}
	int lenn=strlen(res);
	char *res2=new char[lenn];
	int count=lenn;
	for (int c=0;c<lenn;c++)
	{
		res2[c]=res[count-1];
		count--;
	}
	res2[lenn]='\0';
	return res2;
}
void AddLongInteger(char * pcAddend, char * pcAugend, char * pcAddResult)
{
	int len1=strlen(pcAddend);
	int len2=strlen(pcAugend);
	char s1[100];
	for (int i=0;i<len1;i++)
	{
		s1[i]=pcAddend[i];
	}
	s1[len1]='\0';
	char s2[100];
	for (int j=0;j<len2;j++)
	{
		s2[j]=pcAugend[j];
	}
	s2[len2]='\0';
	if (len1==len2)
	{
		pcAddResult=Addequal(s1,s2,len1,len2);
		pcAddResult[strlen(pcAddResult)]='\0';
		cout<<pcAddResult<<endl;
	}
	if (len1>len2)
	{
		pcAddResult=AddGreat(s1,s2,len1,len2);
		pcAddResult[strlen(pcAddResult)]='\0';
		cout<<pcAddResult<<endl;
	}
	if(len1<len2)
	{
		pcAddResult=AddGreat(s2,s1,len2,len1);
		pcAddResult[strlen(pcAddResult)]='\0';
		cout<<pcAddResult<<endl;
	}
}
int main()
{
	char*s1=new char[N];
	char*s2=new char[N];
	char s3[100];
	while (	cin>>s1>>s2)
	{
		AddLongInteger(s1,s2,s3);
	}
	return 0;
}