C语言【微项目03】—大整数加法器（采用人手算加法过程实现）【2021-10-02】

BigIntadd.c

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
struct result_node
{char ch;struct result_node* next;
};int tonum(char n)
{return n-'0';
}
int main()
{int n,m;int jw=0;int i,j;int vi,vj,vii,vjj;//vi、vj指示非零数字起点位置 int svii=0,svjj=0;//svii、svjj指示符号的位置 struct result_node* head,*p;struct result_node* q;struct result_node* t;char a[100],b[100];//支持最多一百位两个同符号数相加，可通过修改数组长度，更改运算范围printf("\n输入第一个整数：");scanf("%s",a);printf("\n输入第二个整数：");scanf("%s",b);head = (struct result_node*)malloc(sizeof(struct result_node));//创建头结点p=head;//让移动指针初始化指向头结点 head->ch='p';//将头结点数据域赋值'p' head->next=NULL;//头结点指针域置空 for(i=0;i<strlen(a);i++){if(svii==0&&a[i]!='0'){vii=i;svii=1;}if(a[i]>='1'&&a[i]<='9'){vi=i;break;}}//找到数字起点与符号位置（如果有），过滤0前缀与符号 for(j=0;j<strlen(b);j++){if(svjj==0&&b[j]!='0'){vjj=j;svjj=1;}if(b[j]>='1'&&b[j]<='9'){vj=j;break;}}//找到数字起点与符号位置（如果有），过滤0前缀与符号for(jw=0,i=strlen(a)-1,j=strlen(b)-1;i>=vi && j>=vj;i--,j--){if(   jw+tonum(a[i])+tonum(b[j]) <=9   ){q = (struct result_node*)malloc(sizeof(struct result_node));q->ch= (jw+tonum(a[i])+tonum(b[j]))+'0';//printf("q:%c\n",q->ch);q->next=p->next;head->next=q;//头插法建立结果数的链表p=head;//printf("%d\n",jw+tonum(a[i])+tonum(b[j]));jw=0;}else{q = (struct result_node*)malloc(sizeof(struct result_node));q->ch= (jw+tonum(a[i])+tonum(b[j]))%10+'0';//printf("q:%c\n",q->ch);q->next=p->next;head->next=q;//头插法建立结果数的链表p=head;//printf("%d\n",(jw+tonum(a[i])+tonum(b[j]) )%10);jw=1;}	}if(i<vi && j>=vj){for(;j>=vj;j--){if(   jw+tonum(b[j]) <=9   ){q = (struct result_node*)malloc(sizeof(struct result_node));q->ch= (jw+tonum(b[j]))+'0';//printf("q:%c\n",q->ch);q->next=p->next;head->next=q;//头插法建立结果数的链表p=head;//printf("%d\n",jw+tonum(b[j]));jw=0;}else{q = (struct result_node*)malloc(sizeof(struct result_node));q->ch= (jw+tonum(b[j]))%10+'0';//printf("q:%c\n",q->ch);q->next=p->next;head->next=q;//头插法建立结果数的链表p=head;//printf("%d\n",(jw+tonum(b[j]) )%10);jw=1;}}printf("\n(%s)+(%s)=",&a[vii],&b[vjj]); if(a[vii]=='-'&&b[vjj]=='-'){printf("-");}if(jw==1){printf("1");}p=head->next;while(p!=NULL){printf("%c",p->ch);p=p->next;}p=head;t=p->next;while(t!=NULL){free(p);p=t;t=p->next; }p=NULL;head=NULL;t=NULL;q=NULL;return 0;}if(j<vj && i>=vi){for(;i>=vi;i--){if(   jw+tonum(a[i]) <=9   ){q = (struct result_node*)malloc(sizeof(struct result_node));q->ch= (jw+tonum(a[i]))+'0';//printf("q:%c\n",q->ch);q->next=p->next;head->next=q;//头插法建立结果数的链表p=head;//printf("%d\n",jw+tonum(a[i]));jw=0;}else{q = (struct result_node*)malloc(sizeof(struct result_node));q->ch= (jw+tonum(a[i]))%10+'0';//printf("q:%c\n",q->ch);q->next=p->next;head->next=q;//头插法建立结果数的链表p=head;//printf("%d\n",(jw+tonum(a[i]) )%10);jw=1;}}printf("\n(%s)+(%s)=",&a[vii],&b[vjj]); if(a[vii]=='-'&&b[vjj]=='-'){printf("-");}if(jw==1){printf("1");}p=head->next;while(p!=NULL){printf("%c",p->ch);p=p->next;}p=head;t=p->next;while(t!=NULL){free(p);p=t;t=p->next; }head=NULL;t=NULL;p=NULL;q=NULL;return 0;}printf("\n(%s)+(%s)=",&a[vii],&b[vjj]); if(a[vii]=='-'&&b[vjj]=='-'){printf("-");}if(jw==1){printf("1");}p=head->next;while(p!=NULL){printf("%c",p->ch);p=p->next;}p=head;t=p->next;while(t!=NULL){free(p);p=t;t=p->next; }head=NULL;t=NULL;p=NULL;q=NULL;return 0;
}

运行结果示例

------------------------------------------------------第三次发项目类文章有点激动啊！-----------------------------------------------------
-----------------------------------------------------【C语言—微项目—自编练习】------------------------------------------------------
----------------------------------------------------------------【TDTX】-----------------------------------------------------------------