登 录
#include <stdio.h><br /> #include <stdlib.h><br /> typedef struct large_num_part<br /> {<br /> struct large_num_part *last;//record last struct's adress,the first struct's is '/0'<br /> char num; //record number part, each has 1 number<br /> struct large_num_part *next;//record next struct's adress, the last struct's is '/0'<br /> } LIN;<br /> //claim for large-int-numbers<br /> LIN *num1_head = '/0', *num1_tail = '/0';<br /> LIN *num2_head = '/0', *num2_tail = '/0';<br /> LIN *result_head = '/0',*result_tail = '/0';<br /> /*===============Claim of Mathods================*/<br /> /*==============get_large_num()==============*/<br /> void get_large_num(void);<br /> void get_1st_num(void);<br /> void get_2nd_num(void);<br /> LIN* get_num_tail(void);<br /> LIN* get_num_head(LIN *tail);<br /> /*=============END=============*/<br /> /*===============plus_2_large_num()==========*/<br /> void plus_2_large_num(void);<br /> char single_plus(LIN *p1,LIN *p2);<br /> LIN *plus_tail(LIN *head, LIN *p1, LIN *p2);<br /> char special_plus(LIN *p,char *temp);<br /> /*=============END=============*/<br /> /*================print_result()=============*/<br /> void print_result(void);<br /> /*=============END=============*/<br /> /*=====================END=======================*/<br /> /*=============================== MAIN BODY =============================*/<br /> int main()<br /> {<br /> //2 large-int-number given by user<br /> get_large_num();<br /> //plus 2 large-int-number and feedback 1 new-large-int-number<br /> plus_2_large_num();<br /> //print the result<br /> print_result();<br /> return 0;<br /> }<br /> /*================================= END ================================*/</p> <p>/*================================= GET L.I.N. ====================================*/<br /> void get_large_num()<br /> {<br /> get_1st_num();<br /> get_2nd_num();<br /> }<br /> //devide get_large_num() into 2 methods, as i have 2 pointers with different names,<br /> //if i need a better way, i should change the way i use the head && tail of two numbers!<br /> void get_1st_num()<br /> {<br /> printf("Please input your first number:/n");<br /> num1_tail=get_num_tail();<br /> num1_head=get_num_head( num1_tail );<br /> }<br /> void get_2nd_num()<br /> {<br /> printf("Please input your second number:/n");<br /> num2_tail=get_num_tail();<br /> num2_head=get_num_head( num2_tail );<br /> }<br /> LIN* get_num_tail()<br /> {<br /> char temp;<br /> LIN* tail='/0';<br /> /*<br /> *the 1st time create a struct need a special progress<br /> *ONLY USE TAIL, as a devided metods,<br /> *use tail pointer to gfet a new room && edit the first struct<br /> *1st part's last && next = '/0'<br /> */<br /> temp=getchar();<br /> //get a new room<br /> tail=(LIN*)malloc(sizeof(LIN));<br /> //edit inner info.<br /> tail->last='/0';<br /> tail->next='/0';<br /> tail->num=temp-48;<br /> //return tail to up method<br /> return tail;<br /> }<br /> LIN* get_num_head(LIN *tail)<br /> {<br /> char temp;<br /> LIN *head,*pold,*pnew;<br /> head=tail;<br /> pnew=tail;<br /> /*<br /> *after the 1st struct<br /> *record the numbers from tail to head<br /> *so that can plus the number from the last position to the top position<br /> *use 'pnew' as NEW STRUCT LEADER, use 'pold' record LAST ONE'S ADRESS<br /> *E.G. -- head->pnew->pold->tail FOUR-STRCUT-EXAMPLE<br /> */<br /> while( ( temp = getchar() ) != '/n')<br /> {<br /> //exchang commender for adress<br /> pold = pnew;<br /> //malloc new romm && create a new LIN<br /> pnew = ( LIN* )malloc( sizeof(LIN) );<br /> //edit front info.--head adress<br /> head = pnew;<br /> //edit behinde info.--last LIN's tail adress<br /> pold->last = pnew;<br /> //edit inner info. in 'pnew'<br /> pnew->last = '/0';<br /> pnew->num = temp - 48;<br /> pnew->next = pold;<br /> }<br /> return head;<br /> }<br /> /*================================= END ===================================*/</p> <p>/*=================================== P L U S ===================================*/<br /> void plus_2_large_num()<br /> {<br /> result_head=(LIN*)malloc(sizeof(LIN));<br /> result_tail=plus_tail(result_head,num1_head,num2_head);<br /> }<br /> LIN *plus_tail(LIN *head, LIN *p1, LIN *p2)<br /> {<br /> LIN *result_new,*result_old,*tail;<br /> result_new=head;<br /> tail=head;<br /> result_new->last='/0';<br /> result_new->next='/0';<br /> result_new->num=single_plus( p1,p2 );<br /> if(p1)<br /> {<br /> p1=p1->next;<br /> }<br /> if(p2)<br /> {<br /> p2=p2->next;<br /> }<br /> /*第一次以后的运算*/<br /> while( p1||p2 )<br /> {<br /> result_old=result_new;<br /> result_new=(LIN*)malloc(sizeof(LIN));<br /> tail=result_new;<br /> result_old->next=result_new;<br /> result_new->last=result_old;<br /> result_new->next='/0';<br /> result_new->num=single_plus( p1,p2 );<br /> if(p1)<br /> {<br /> p1=p1->next;<br /> }<br /> if(p2)<br /> {<br /> p2=p2->next;<br /> }<br /> }<br /> return tail;<br /> }<br /> char single_plus(LIN *p1,LIN *p2)<br /> {<br /> static char temp;<br /> char digit;<br /> if(p1&&p2)<br /> {<br /> /*<br /> *p1 p2 都是存在数的情况下，进行计算。<br /> *temp先计算两数相加：<br /> *1、如果是两位数（大于9）：temp为1，记录进位的1。digit记录个位数，并返回。<br /> *2、如果是一位数：temp赋值给digit，并返回。<br /> */<br /> temp += p1->num + p2->num ;<br /> if( temp > 9)<br /> {<br /> digit = temp - 10;<br /> temp = 1;<br /> }else<br /> {<br /> digit = temp;<br /> temp = 0;<br /> }<br /> //最高位进位检查<br /> if(p1->next=='/0'&&<br /> p2->next=='/0'&&<br /> temp == 1)<br /> {<br /> digit += 10;<br /> }<br /> }else if(p1)<br /> {<br /> /*<br /> *p1 存在数、p2 为空的情况下，进行计算。<br /> *1、如果 temp 中存有进位的值（只能是 1 ），判断p1 是不是9：<br /> * 1、是 9 ，temp 保持 1 ，digit 赋值为 0 ，并返回。<br /> * 2、不是 9 ，p1 加 1 ，赋值给 digit ，并返回。<br /> *2、如果 temp 不是 1 即为 0 （说明上一位的计算没有进位）：temp赋值给digit，并返回。<br /> */<br /> digit=special_plus(p1,&temp);<br /> }else<br /> {<br /> /*<br /> *p1 为空、p2 存在数的情况下，进行计算。<br /> *1、如果 temp 中存有进位的值（只能是 1 ），判断p2 是不是9：<br /> * 1、是 9 ，temp 保持 1 ，digit 赋值为 0 ，并返回。<br /> * 2、不是 9 ，p1 加 1 ，赋值给 digit ，并返回。<br /> *2、如果 temp 不是 1 即为 0 （说明上一位的计算没有进位）：temp赋值给digit，并返回。<br /> */<br /> digit=special_plus(p2,&temp);<br /> }<br /> return digit;<br /> }<br /> char special_plus(LIN *p,char *temp)<br /> {<br /> char digit=0;<br /> if(*temp == 1)<br /> {<br /> if( p->num == 9)<br /> {<br /> digit = 0;<br /> }else<br /> {<br /> digit = p->num + 1;<br /> *temp = 0;<br /> }<br /> }else<br /> {<br /> digit = p->num;<br /> }<br /> //最高位进位检查<br /> if(p->next=='/0'&&<br /> *temp ==1 )<br /> {<br /> digit += 10;<br /> *temp=0;<br /> }<br /> return digit;<br /> }<br /> /*================================= END ===================================*/<br /> /*================================= P R I N T ===================================*/<br /> void print_result()<br /> {<br /> LIN *p;<br /> p=result_tail;<br /> printf("/n");<br /> /*printf("%d",p->num);<br /> do<br /> {<br /> p=p->last;<br /> printf("%d",p->num);<br /> }while(p->last!='/0');<br /> */<br /> while (p)<br /> {<br /> printf("%d",p->num);<br /> p=p->last;<br /> }<br /> printf("/n");<br /> }<br /> /*================================= END ===================================*/<br />
抱歉!评论已关闭.