设计逆置线性表的程序.docVIP

淘宝店530213算法与数据结构实验报告 ___2012___级 __03___班 __2013__年__10__月__30_日 姓名__淘宝店530213__ 学号___记住530213__ 实验题目 设计逆置线性表的程序 分析及解题思路 创造链表做为线性表储存数据，在对链表中的数据逆置。逆置的方法为创建一个新的结点，将链表给新的结点，再将最后的结点接到原来的头结点上，循环此操作将链表逆置。 算法设计及程序代码 #include stdio.h #include malloc.h #include stdlib.h //***************************** typedef struct node { int data; struct node *pnext; }NODE,*PNODE; //***************************** PNODE make_list(); void traverse_list( PNODE PHEAD ); int count_list(PNODE PHEAD); void REVERSE_POSITION ( PNODE PHEAD ); //***************************** void main() { PNODE PS = make_list(); traverse_list ( PS ); REVERSE_POSITION ( PS ); printf(逆置后的链表：); traverse_list ( PS ); } PNODE make_list() { int i = 0; int len = 0; int tem = 0; PNODE PHEAD = ( PNODE )malloc(sizeof(NODE)); PHEAD-pnext = NULL; PNODE PMOVE = PHEAD; if(NULL == PHEAD) { printf(分配失败，程序结束。); exit(-1); } printf( the length = ); scanf(%d,len); for( i = 0;i len;i++) { PNODE PNEW = (PNODE)malloc(sizeof(NODE)); if(NULL == PNEW ) { printf(分配失败，程序结束); exit(-1); } printf(请输入第%d个元素：,i+1); scanf(%d,tem); PNEW-data = tem; PMOVE-pnext = PNEW; PNEW-pnext = NULL; PMOVE = PNEW; } return PHEAD; } void traverse_list ( PNODE PHEAD ) { PNODE PMOVE = PHEAD-pnext ; while( NULL!= PMOVE) { printf(%d , PMOVE-data ); PMOVE = PMOVE-pnext; } printf(\n遍历结束。\n ); } int count_list(PNODE PHEAD) { int i = 0; PNODE PMOVE = PHEAD-pnext ; while( NULL!= PMOVE) { i++; PMOVE = PMOVE-pnext; } return i; } void REVERSE_POSITION ( PNODE PHEAD ) { PNODE PMOVE = (PNODE)malloc(sizeof(NODE)); PNODE PNEWHEAD = (PNODE)malloc(sizeof(NODE)); if(NULL == PMOVE ||NULL == PNEWHEAD ) { printf(分配失败，程序结束); exit(-1); } int b = 0; int i = count_list ( PHEAD ); PNEWHEAD-pnext = PHEAD-pnext ; PHEAD-pnext = NULL; PNODE PNMOVE = PHEAD; for(int a = i; a 0 ; a--) { PMOVE = PNEWHEAD; for(b = 0;b a -1 ; b++ ) { PMOVE = PMOVE-pnext ;