C语言用链表写大数乘法,用链表实现的超大数阶乘运算

本文介绍了一个使用链表来实现超大数运算的程序,包括加法、乘法及阶乘等功能。该程序重点在于理解链表操作与大数处理技巧,适合初学者学习。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

代码风格很滥,请多多包涵,这个程序主要是为了练习链表的用法,因此没有考虑到效率的问题,里面涉及了超大数的存储,加法,乘法,最后才复合成了阶乘,希望对大家有一点用

#include

#include

typedef struct record

{

char n ;

struct record*next ;

}

node,*pnode;

pnode inputint()   //input record

{

pnode p,q=NULL ;

char c ;

while((c=getchar())!=’\n’)

{

p=(pnode)malloc(sizeof(node));

p->n=c  ;

p->next=q ;

q=p ;

}

return p ;

}

void destroy(pnode p)    //destroy list

{

pnode q=p ;

while(p)

{

p=p->next ;

q->n=’0′ ;

free(q);

q=p ;

}

}

pnode insertint(pnode p,int n)   //insert record

{

pnode q=(pnode)malloc(sizeof(node));

q->n=n+’0′;

q->next=NULL ;

if(p)p->next=q ;

p=q ;

return p ;

}

pnode plus(pnode p1,pnode p2)    //two long numbers plus

{

int s,i=0 ;

pnode p=(pnode)malloc(sizeof(node)),q,m1=p,m2 ;

if(!p1&&!p2)return NULL ;

while(p1&&p2)

{

s=(p1->n-’0′+p2->n-’0′+i)%10 ;

i=(p1->n-’0′+p2->n-’0′+i)/10 ;

p=insertint(p,s);

p1=p1->next,p2=p2->next ;

}

q=p1?p1:p2 ;

while(q)

{

s=(q->n-’0′+i)%10  ;

i=(q->n-’0′+i)/10 ;

p=insertint(p,s);

q=q->next ;

}

if(i)p=insertint(p,i);

m2=m1->next ;

free(m1);

return m2 ;

}

void printint(pnode p)     //output record

{

pnode a=p,b=a->next,temp=NULL;

while(a)

{

a->next=temp;

temp=a;

a=b;

if(b)b=b->next;

}

while(temp)

{

printf(“%c”,temp->n);

temp=temp->next;

}

printf(“\n”);

}

pnode insertzero(pnode p,int n)    //insert zero

{

int i=0 ;

pnode q ;

while(i

{

q=(pnode)malloc(sizeof(node));

q->n=’0′;

q->next=p ;

p=q ;

i++;

}

return p ;

}

pnode copylist(pnode p)     //copy list

{

pnode q=(pnode)malloc(sizeof(node)),r1=q,r2 ;

q->next=NULL ;

while(p)

{

q=insertint(q,p->n-’0′);

p=p->next ;

}

r2=r1->next ;

free(r1);

return r2 ;

}

pnode multiply(pnode p,int n,int j)    //two long numbers multiply

{

int i=0,s ;

pnode q=(pnode)malloc(sizeof(node)),s1=q,s2 ;

q->next=NULL ;

while(p)

{

s=(n*(p->n-’0′)+i)%10 ;

i=(n*(p->n-’0′)+i)/10 ;

q=insertint(q,s);

p=p->next ;

}

if(i)q=insertint(q,i);

s2=s1->next ;

free(s1);

return insertzero(s2,j);

}

pnode fun(pnode p1,pnode p2)   //integrate calculate

{

pnode q1,q2=NULL,s=NULL ;

int i=0 ;

while(p1&&p2)

{

q1=multiply(p1,p2->n-’0′,i);

s=plus(q1,q2);

destroy(q2);

destroy(q1);

q2=s ;

p2=p2->next ;

i++;

}

return s ;

}

pnode check(pnode p)    //check whether has zero before head

{

pnode q=NULL,r=p ;

if(!p)return NULL ;

while(p->next)

{

q=p ;

p=p->next ;

}

if(q&&p->n==’0′)

{

q->next=NULL ;

free(p);

return r ;

}

else

{

if(p->n!=’0′)return r ;

else return NULL ;

}

}

pnode f(pnode p)    //return number minus one

{

pnode q=p ;

while(q)

{

if(q->n>’0′)

{

q->n–;

return check(p);

}

else

{

q->n=’9′ ;

q=q->next ;

}

}

return check(p);

}

int main()

{

pnode p,q,r ;

system(“cls”);

printf(“please input a number:”);

p=inputint();

q=copylist(p);

while(p)

{

p=f(p);

if(!p)break ;

r=fun(q,p);

destroy(q);

q=r ;

}

printint(q);

destroy(q);

return 0;

}

实现大数乘法可以使用链表来存储每一位数字,具体实现步骤如下: 1. 定义链表结构体,包含一个int类型的数据域和指向下一个节点的指针域。 ```c typedef struct node { int data; struct node *next; } Node; ``` 2. 定义两个字符串,分别存储要相乘的两个大数。 ```c char num1[] = "123456789"; char num2[] = "987654321"; ``` 3. 将两个字符串转化为链表,将每一位数字存储到链表中。 ```c Node *num1List = NULL; Node *num2List = NULL; for (int i = strlen(num1) - 1; i >= 0; i--) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = num1[i] - '0'; newNode->next = num1List; num1List = newNode; } for (int i = strlen(num2) - 1; i >= 0; i--) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = num2[i] - '0'; newNode->next = num2List; num2List = newNode; } ``` 4. 定义一个新的链表,用来存储计算结果。 ```c Node *resultList = NULL; ``` 5. 从链表num2List的最低位开始,依次将每一位与链表num1List中的每一位相乘,将计算结果相加得到最终结果。具体实现过程如下: ```c Node *num2Node = num2List; int shift = 0; // 用于记录当前位数,也就是需要在结果中加上的0的个数 while (num2Node != NULL) { Node *num1Node = num1List; int carry = 0; // 用于记录进位 Node *tempResultList = NULL; // 在结果中加上shift个0 for (int i = 0; i < shift; i++) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = 0; newNode->next = tempResultList; tempResultList = newNode; } while (num1Node != NULL) { int tempResult = num1Node->data * num2Node->data + carry; carry = tempResult / 10; Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = tempResult % 10; newNode->next = tempResultList; tempResultList = newNode; num1Node = num1Node->next; } // 如果还有进位,需要将进位加到结果的最高位 if (carry > 0) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = carry; newNode->next = tempResultList; tempResultList = newNode; } // 将tempResultList中的结果与resultList相加 Node *tempNode = tempResultList; Node *resultNode = resultList; carry = 0; while (tempNode != NULL || carry > 0) { int tempData1 = resultNode == NULL ? 0 : resultNode->data; int tempData2 = tempNode == NULL ? 0 : tempNode->data; int tempResult = tempData1 + tempData2 + carry; carry = tempResult / 10; if (resultNode == NULL) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = tempResult % 10; newNode->next = NULL; resultList = newNode; resultNode = resultList; } else { resultNode->data = tempResult % 10; if (resultNode->next == NULL && (tempNode != NULL || carry > 0)) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = 0; newNode->next = NULL; resultNode->next = newNode; } resultNode = resultNode->next; } tempNode = tempNode == NULL ? NULL : tempNode->next; } shift++; num2Node = num2Node->next; } ``` 6. 将计算结果从链表中取出,输出到控制台。 ```c Node *tempNode = resultList; while (tempNode != NULL) { printf("%d", tempNode->data); tempNode = tempNode->next; } printf("\n"); ``` 完整代码如下: ```c #include <stdio.h> #include <stdlib.h> #include <string.h> typedef struct node { int data; struct node *next; } Node; int main() { char num1[] = "123456789"; char num2[] = "987654321"; Node *num1List = NULL; Node *num2List = NULL; for (int i = strlen(num1) - 1; i >= 0; i--) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = num1[i] - '0'; newNode->next = num1List; num1List = newNode; } for (int i = strlen(num2) - 1; i >= 0; i--) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = num2[i] - '0'; newNode->next = num2List; num2List = newNode; } Node *resultList = NULL; Node *num2Node = num2List; int shift = 0; while (num2Node != NULL) { Node *num1Node = num1List; int carry = 0; Node *tempResultList = NULL; for (int i = 0; i < shift; i++) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = 0; newNode->next = tempResultList; tempResultList = newNode; } while (num1Node != NULL) { int tempResult = num1Node->data * num2Node->data + carry; carry = tempResult / 10; Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = tempResult % 10; newNode->next = tempResultList; tempResultList = newNode; num1Node = num1Node->next; } if (carry > 0) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = carry; newNode->next = tempResultList; tempResultList = newNode; } Node *tempNode = tempResultList; Node *resultNode = resultList; carry = 0; while (tempNode != NULL || carry > 0) { int tempData1 = resultNode == NULL ? 0 : resultNode->data; int tempData2 = tempNode == NULL ? 0 : tempNode->data; int tempResult = tempData1 + tempData2 + carry; carry = tempResult / 10; if (resultNode == NULL) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = tempResult % 10; newNode->next = NULL; resultList = newNode; resultNode = resultList; } else { resultNode->data = tempResult % 10; if (resultNode->next == NULL && (tempNode != NULL || carry > 0)) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->data = 0; newNode->next = NULL; resultNode->next = newNode; } resultNode = resultNode->next; } tempNode = tempNode == NULL ? NULL : tempNode->next; } shift++; num2Node = num2Node->next; } Node *tempNode = resultList; while (tempNode != NULL) { printf("%d", tempNode->data); tempNode = tempNode->next; } printf("\n"); return 0; } ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值