数据结构答案（Data structure answer）.doc

数据结构答案（Data structure answer） Problem analysis and algorithm design First, a data structure is designed to represent an extra long integer, and then the algorithm can be designed. First, we use a header node with a ring chain to represent a non negative integer large, if for each number from the beginning is low, first to fourth, fifth to eighth... Each consisting of four bit numbers, followed on the list of the first and second nodes,... In the lack of MSB 4 stored in the last node list in the specified header node for -1 value. Such as: The big integer 587890987654321 can be represented by the following list of linked nodes head: In accordance with this data structure, you can start from the two header nodes, in turn corresponding to add, to find the required carrying descendants into the following operations. Specific implementation algorithm, please see the notes in the program. * program and program notes #includestdio.h #includestdlib.h #define HUNTHOU 10000 Typedef, struct, node{, int, data; Struct node *next; }NODE; / * * / define the list structure NODE *insert_after (NODE *u, int Num); / * insert a new NODE in the U node, its value is num*/ NODE *addint (NODE *p, NODE *q); / * complete addition operator returns a pointer to pointer * / *p+*q results Void printint (NODE *s); NODE *inputint (void); Void, main () { NODE, *s1, *s2, *s; NODE, *inputint (), *addint (), *insert_after (); Printf (Enter S1=); (s1=inputint); / * * / input addend Printf (Enter S2=); (s2=inputint); / * * / input addend Printf (S1=); printint (S1); putchar (\\\n\); / * * / display addend Printf (S2=); printint (S2); putchar (\\\n\); / * * / display number S=addint (S1, S2); / * and * / Printf (S1+S2=); printint (s); putchar (\\\n\); / * * / output } NODE *insert_after (NODE, *u, int, Num) { NODE *v; V= (NODE * malloc) (sizeof (NODE)); / * for a NODE*/ V-data=num; / * * / assignment U-next=v; / * insert a NODE*/ in the U node Return v; } NODE *addint (NODE *p, NODE *q) / * complete addi