線性鏈表的實現(xiàn)及操作

- 學(xué)生姓名學(xué)生班級學(xué)生** 指導(dǎo)教師 -1、設(shè)計一個100位以內(nèi)的長整數(shù)加減運算的程序。要求如下：輸入輸出要求：每四位一組，組間用逗號分隔；加和減分別用不同的程序?qū)崿F(xiàn)程序應(yīng)考慮輸入數(shù)據(jù)的符號2、用循環(huán)鏈表實現(xiàn)約瑟夫環(huán)問題數(shù)與被減數(shù)的長短關(guān)。Number*GetNumber(){Number*p,*q,*List;p=(Number*)malloc(LEN);stpList->prior=NULL;List->data=0;{{-locLENhetq}}tNULLiorNULList}NumberJiaFa(Number*num_1,Number*num_2)//返回的數(shù)據(jù)為逆序{Numberp*q,*r,*s,*num=NULL;p=num_1;while(p->ne*t!=NULL){pnet}q=num_2;while(q->ne*t!=NULL){q=q->ne*t;}s=(Number*)malloc(LEN);s->prior=NULL;//i表示number1數(shù)字的長度//j表示number2數(shù)字的長度-while(i--&&j--){{ppriordataa}mbermallocLENrsrior}prior{while(i--){{pdatappriordata}點-riors}{s}}{while(j--){{a}s}{-s}}um}ne*t置空NumberJianFa(Number*num_1,Number*num_2)//返回的數(shù)據(jù)也為逆序{Numberp*q,*r,*s,*num=NULL;p=num_1;while(p->ne*t!=NULL){p=p->ne*t;}q=num_2;while(q->ne*t!=NULL){q=q->ne*t;}s=(Number*)malloc(LEN);s->prior=NULL;s->ne*t=NULL;num=s;數(shù)的，用減數(shù)減去被減數(shù)，最后反號{while(i--){s->data=q->data-p->data;if(s->data<0){//i表示number1數(shù)字的長度//j表示number2數(shù)字的長度//對于被減數(shù)長度小于減-q->prior->data--;}bermallocLENrsriorj--;}priorwhile(j--){{q->prior->data--;}s}}{umqnumwhilep>data==q->data){pnet}mNumbermallocLENriorNULL點-mdatamnetpumNumbermallocLENriorNULLmdatamnetqwhile(p->ne*t!=NULL){ppnet;}while(q->ne*t!=NULL){}atanumnetdata{while(i--){ata{p->prior->data--;}rNumbermallocLEN);iorspprior}r=s=s->prior;//去掉最后一個沒數(shù)據(jù)的節(jié)點free(s->ne*t);while(s->data==0&&s->prior!=NU去)掉前面多余的0，1{s=s->prior;free(s->ne*t);-}}tdata{while(i--){{q->prior->data--;}mbermallocLENrsrior}r=s=s->prior;//去掉最后一個沒數(shù)據(jù)的節(jié)點free(s->ne*t);while(s->data==0&&s->prior!=NU去)掉前面多余的0，1{s=s->prior;free(s->ne*t);}}s->data=0-s->data;能放符號，而直接在最高位前加負(fù)號最簡單s->ne*t=NULL;}{while(j--){s->data=p->data-q->data;if(s->data<0){s->data+=10;}//反號，因為節(jié)點里不-mbermallocLENrsriori--;}rssprior//去掉最后一個沒數(shù)據(jù)的節(jié)點while(i--){{datap->prior->data--;}riors}while(s->data==0&&s->prior!=NULL)//去掉前面多余的0，否{s=s->prior;free(s->ne*t);}//s->data=0-s->data;//反號，因為節(jié)點里不能放符號，而直接在最高位前加負(fù)號最簡單s->ne*t=NULL;}returnnum;}4.鏈表的合并voidPutNumber(Number*num)/表的合并{Number*p;-while(p->ne*t!=NULL){pnet}while(k--){printfdpdata);rior完后不輸出','}}遇到的問題及解決方法hhzeofNumber{Numbernet-Numberprior;{dDestoryListNumberdPutNumberNumberNumberGetNumber();數(shù)NumberJiaFa(Number*num_1,Number*num_2);//加法函數(shù)Number*JianFa(Number*num_1,Number*num_2);//減法函數(shù)Numbernumber_1,*number_2,*number;charch//存放運算符號printfEnterthefirstlongnumbern);berGetNumberprintf("put+or-:\n");fflush(stdin);//吸收不相關(guān)的字符printfEnterthesecondlongnumbern);erGetNumbernumberJiaFanumbernumber2);numberJianFanumbernumber2);ntfnmbernumberoryListnumberDestoryList(number_1);DestoryListnumber2);}NumberGetNumber(){Numberp,*q,*List;NumbermallocLENiorNULLdata{{-locLENhetq}}tNULLiorNULList長度一樣與不同NumberJiaFa(Number*num_1,Number*num_2)//返回的數(shù)據(jù)為逆序{Numberp*q,*r,*s,*num=NULL;p=num_1;while(p->ne*t!=NULL){pnet}q=num_2;while(q->ne*t!=NULL){q=q->ne*t;}s=(Number*)malloc(LEN);s->prior=NULL;s->ne*t=NULL;num=s;while(i--&&j--){s->data=p->data+q->data;if(s->data>9){s->data-=10;況，后面還有p->prior->data++;//i表示number1數(shù)字的長度//j表示number2數(shù)字的長度//**處理兩數(shù)相加大于9的情//在長的數(shù)據(jù)上調(diào)整-a}mbermallocLENrsrior}prior{while(i--){{pdatappriordata}riors}{s}}{while(j--){{點-a}s}{s}}ne*t置空umNumberJianFa(Number*num_1,Number*num_2)//返回的數(shù)據(jù)也為逆序{Numberp*q,*r,*s,*num=NULL;p=num_1;while(p->ne*t!=NULL){p=p->ne*t;}q=num_2;while(q->ne*t!=NULL){q=q->ne*t;}s=(Number*)malloc(LEN);s->prior=NULL;s->ne*t=NULL;//i表示number1數(shù)字的長度//j表示number2數(shù)字的長度-數(shù)的，用減數(shù)減去被減數(shù)，最后反號{while(i--){s->data=q->data-p->data;if(s->data<0){s->data+=10;q->prior->data--;}r=(Number*)malloc(LEN);s->ne*t=r;r->prior=s;s=r;p=p->prior;q=q->prior;}r=s=s->prior;free(s->ne*t);s->ne*t=NULL;while(j--){if(q->data<0){q->data+=10;q->prior->data--;}s=(Number*)malloc(LEN);s->data=q->data;q=q->prior;r->ne*t=s;s->prior=r;r=s;}s->data=0-s->data;符號，而直接在最高位前加負(fù)號最簡單s->ne*t=NULL;}elseif(i==j){//對于被減數(shù)長度小于減//去掉最后一個沒數(shù)據(jù)的節(jié)點-pnum_1;q=num_2;while(p->data==q->data){pnet}umNumbermallocLENriorNULLmdatamnetpumNumbermallocLENriorNULLmdatamnetq{ppnet;}{}atanumnetdata{while(i--){ata{p->prior->data--;}rNumbermallocLEN);iorspprior-}r=s=s->prior;//去掉最后一個沒數(shù)據(jù)的節(jié)點free(s->ne*t);while(s->data==0&&s->prior!=NU去)掉前面多余的0，1{s=s->prior;free(s->ne*t);}}if(num_1->ne*t->data<num_2->ne*t->data){while(i--){s->data=q->data-p->data;if(s->data<0){s->data+=10;}r=(Number*)malloc(LEN);s->ne*t=r;r->prior=s;p=p->prior;q=q->prior;}r=s=s->prior;//去掉最后一個沒數(shù)據(jù)的節(jié)點free(s->ne*t);while(s->data==0&&s->prior!=NU去)掉前面多余的0，1{s=s->prior;free(s->ne*t);}}s->data=0-s->data;能放符號，而直接在最高位前加負(fù)號最簡單s->ne*t=NULL;}//反號，因為節(jié)點里不-{while(j--){{p->prior->data--;}mbermallocLENrsriori--;}priorwhile(i--)點{{datap->prior->data--;}riors}while(s->data==0&&s->prior!=NULL)//去掉前面多余的0，否{s=s->prior;free(s->ne*t);}//s->data=0-s->data;//反號，因為節(jié)點里不能放符號，而直接在最高位前加負(fù)號最簡單s->ne*t=NULL;}-um}tNumberNumbernum{Number*p;while(p->ne*t!=NULL){pnet}while(k--){printfdpdata);rior不輸出','char}harn}storyListNumberlist{Number*p,*q;whilep{}}#include<stdio.h>#include<stdlib.h>{structLnodenet;Lnode*p,*q,*head;-{printfhowmanynumbersdoyouwant;n{printfnniserorr!\n\n");printfhowmanynumbersdoyouwa