登 录
#include <stdio.h><br /> #include <stdlib.h><br /> #include <malloc.h><br /> #include <windows.h> </p> <p>/**********双向链表节点**********/<br /> typedef struct student<br /> {<br /> int num;<br /> float score;<br /> struct student *prior;<br /> struct student *next;<br /> }TYPE; </p> <p>int nod_num; //节点数<br /> #define LEN sizeof(TYPE) //节点长度 </p> <p>/*=================================================<br /> 函数功能: 创建双向链表<br /> 返 回 值: 双向链表的头指针<br /> =================================================*/<br /> TYPE* create_link(void)<br /> {<br /> TYPE *head = NULL;<br /> TYPE *p1,*p2; </p> <p> nod_num = 0;<br /> p1 = p2 = (TYPE *)malloc(LEN);<br /> printf("input the %d node--num,score!/n",(nod_num+1));<br /> scanf("%d,%f",&(p1->num),&(p1->score));<br /> while(p1->num != 0)<br /> {<br /> nod_num++;<br /> if(nod_num == 1)<br /> {<br /> head = p1;<br /> head->prior = NULL; //首节点的两个指针为NULL<br /> head->next = NULL;<br /> }<br /> else<br /> {<br /> p1->prior = p2;<br /> p2->next = p1;<br /> }<br /> p2 = p1;<br /> p1 = (TYPE *)malloc(LEN);<br /> printf("input the %d node--num,score!/n",(nod_num+1));<br /> scanf("%d,%f",&(p1->num),&(p1->score));<br /> }<br /> p2->next = head; </p> <p> return head;<br /> } </p> <p>/*=============================================================<br /> 实现功能: 打印指定链表中的全部节点数据，由于循环双向表<br /> 没有头节点，每个节点性质完全一样，只要给出任<br /> 意节点就可以遍历.<br /> 参 数： *head：待打印的链表首址<br /> 特别说明: 链表正向输出(从链表头遍历到链表尾)<br /> =============================================================*/<br /> void nextprint(TYPE *node)<br /> {<br /> TYPE *pb = node;</p> <p> printf("/n链表所有信息如下：/n");<br /> if (pb == NULL)<br /> {<br /> printf("/n");<br /> return;<br /> }<br /> while(pb->next != node)<br /> {<br /> printf("%x/t/t%d/t/t%f/n",pb,pb->num,pb->score);<br /> pb=pb->next;<br /> }<br /> printf("%x/t/t%d/t/t%f/n",pb,pb->num,pb->score);<br /> }</p> <p>/*=============================================================<br /> 实现功能: 打印指定链表中的全部节点数据，由于循环双向表<br /> 没有头节点，每个节点性质完全一样，只要给出任<br /> 意节点就可以遍历.<br /> 参 数： *head：待打印的链表首址<br /> 特别说明: 链表反向输出(从链表尾遍历到链表头)<br /> =============================================================*/<br /> void PriorPrint(TYPE *node)<br /> {<br /> TYPE *p = node; </p> <p> if(p != NULL)<br /> {<br /> while(p->next != node)<br /> p = p->next;<br /> while(p != NULL)<br /> {<br /> printf("num=%d,score=%f/n",p->num,p->score);<br /> p = p->prior;<br /> }<br /> }<br /> } </p> <p>/*================================================<br /> 函数功能: 遍历双向链表，目的是测试链表是否成环<br /> 函数参数: 双向链表的首地址<br /> 返 回 值: 无<br /> ================================================*/<br /> void testprint(TYPE *head)<br /> {<br /> TYPE *p; </p> <p> printf("/nnow,these %d records are:/n",nod_num);<br /> p=head;<br /> if(head!=NULL)<br /> {<br /> do<br /> {<br /> printf("%d %f/n",p->num,p->score);<br /> Sleep(2000);<br /> p=p->next;<br /> }<br /> while (p!=NULL);<br /> }<br /> }</p> <p>/*=========================================<br /> 语法格式： search(TYPE * head,int num)<br /> 实现功能： 搜索给定序号所指向的节点<br /> 参 数： *head 待搜索链表<br /> num 按所需进行节点搜索<br /> 返 回 值： 搜索到的节点首址<br /> =========================================*/<br /> TYPE * search(TYPE * head,int num)<br /> {<br /> TYPE *pb=head;</p> <p> if(head == NULL)<br /> {<br /> return head;<br /> }</p> <p> while((pb->num != num)&&(pb->next!=head))<br /> {<br /> pb=pb->next; //节点后移<br /> }</p> <p> if (pb->num == num)<br /> {<br /> return pb;<br /> }<br /> else<br /> {<br /> printf("/n节点没有找到/n");<br /> return head;<br /> }<br /> }</p> <p>/*=====================================================================<br /> 实现功能： 将新申请的节点加入到指定链表中，并按照num进行从小到大排序<br /> 参 数： *head:待插入链表<br /> * pi：带插入节点<br /> 返 回 值： 插入指定节点后的新链表首址<br /> =====================================================================*/<br /> TYPE * insert(TYPE * head,TYPE * pi)<br /> {<br /> TYPE *pb=head ,*pf;</p> <p> if(head==NULL)//如果为空就建立，空间在传入前申请好<br /> {<br /> head=pi;<br /> pi->prior=head;<br /> pi->next=head;<br /> }<br /> else<br /> {<br /> while((pi->num > pb->num)&&(pb->next!=head)) //找到一个比插入值大的节点，然后插在它的前面<br /> {<br /> pf=pb; //pf指向前，pb指向后<br /> pb=pb->next; //节点后移<br /> }</p> <p> if(pi->num <= pb->num) //找到所要插入节点位置，插到pb的前面<br /> {<br /> if(head==pb) //在第一结点之前插入<br /> {<br /> pi->next = pb;<br /> pi->prior = head->prior;<br /> pb->prior = pi;<br /> head->prior->next = pi; //尾节点<br /> head=pi; //保存头节点<br /> }<br /> else<br /> {<br /> pf->next = pi; //在中间位置插入<br /> pb->prior = pi;<br /> pi->next = pb;<br /> pi->prior = pf;<br /> }<br /> }<br /> else //只有pb->head为空才会成立<br /> {<br /> pb->next = pi; //在表末插入<br /> pi->next = head;<br /> pi->prior = pb;<br /> head->prior = pi; //头始终指向新插入的节点<br /> }<br /> }<br /> return head;<br /> }</p> <p>/*=============================================================<br /> 实现功能： 删除给定序号所指向的节点<br /> 参 数： *head 待删除链表<br /> num 所需删除的节点<br /> 返 回 值： 删除指定节点后的新链表首址<br /> =============================================================*/<br /> TYPE * delete(TYPE * head,int num)<br /> {<br /> TYPE *pf,*pb = head;</p> <p> if(head==NULL)<br /> {<br /> printf("/nempty list!/n");<br /> return NULL;<br /> }</p> <p> while (pb->num!=num && pb->next!=head)<br /> {<br /> pf=pb;<br /> pb=pb->next;<br /> }<br /> if(pb->num==num)<br /> {<br /> if(pb==head)<br /> {<br /> if (pb->next == head && pb->prior == head) //如果只有一个节点<br /> {<br /> free(pb);<br /> head = NULL;<br /> return NULL;<br /> }<br /> pb->next->prior = head->prior; //头节点指向尾<br /> head->prior->next = pb->next; //尾节点指向头<br /> head=pb->next; //得到新头节点地址<br /> }<br /> else<br /> {<br /> pf->next = pb->next;<br /> pb->next->prior = pf;<br /> }<br /> free(pb);<br /> printf("The node is deleted/n");<br /> }<br /> else<br /> printf("The node not been found!/n");</p> <p> return head;<br /> }</p> <p>/******************测试函数*******************/<br /> int main(void)<br /> {<br /> TYPE *head=NULL;<br /> TYPE *Lsearch=NULL;<br /> TYPE *ins=NULL;<br /> int searnum;<br /> int delnum;</p> <p>//创建链表<br /> head = create_link();</p> <p>//输出链表(正向、反向、测试输出)<br /> nextprint(head); //(正向)打印创建的链表<br /> //PriorPrint(head); //(反向)打印创建的链表<br /> //testprint(head);</p> <p>//查寻链表<br /> printf("input search Number:/n");<br /> scanf("%d",&searnum);<br /> Lsearch = search(head,searnum);<br /> nextprint(Lsearch); //从搜索到的节点开始打印</p> <p>//插入链表<br /> ins = (TYPE *)malloc(sizeof(TYPE));<br /> printf("insert Number and Age:/n");<br /> scanf("%d,%f",&(ins->num),&(ins->score));<br /> head = insert(head,ins);<br /> nextprint(head); //打印插入节点后的链表 </p> <p>//删除链表<br /> printf("input delete Number:/n");<br /> scanf("%d",&delnum);<br /> head = delete(head,delnum);<br /> nextprint(head); //打印删除一个节点后的链表 </p> <p> return 0;<br /> }</p> <p>
抱歉!评论已关闭.