时间戳

首页 > 技术文章 > 链表的创建、测长、排序、插入、逆序的实现（C语言）

链表的创建、测长、排序、插入、逆序的实现（C语言）

AmatVictorialCuram 2013-11-21 13:46 原文

  1. #include <stdio.h>
  2. #define END_elem 0
  4. struct node
  5. {
  6. int date;
  7. struct node * next;
  8. };
  10. //链表创建
  11. node * creat()
  12. {
  13. int x;
  14.     node *head,*last,*p;
  15.     head=new node();
  16.     last=head;
  17. scanf("%d",&x);
  18. while(x!=END_elem)
  19. {
  20.         p=new node();
  21.         p->date=x;
  22.         last->next=p;
  23.         last=p;
  24. scanf("%d",&x);
  25. }
  26.     head=head->next;
  27.     last->next=NULL;
  28. return head;
  29. }
  31. //单链表测长
  32. int lenght(node *head)
  33. {
  34. int n=0;
  35.     node *p=head;
  36. while(p!=NULL)
  37. {
  38.         p=p->next;
  39.         n++;
  40. }
  41. return n;
  42. }
  45. //链表排序
  46. node *sort(node *head,int n)
  47. {
  48. int temp;
  49.     node *p;
  50. if(head==NULL||head->next==NULL)
  51. return head;
  52. for(int i=0;i<n-1;i++)
  53. {
  54.         p=head;
  55. for(int j=0;j<n-1-i;j++)
  56. {
  57. if(p->date>p->next->date)
  58. {
  59.                 temp=p->date;
  60.                 p->date=p->next->date;
  61.                 p->next->date=temp;
  62. }
  63.             p=p->next;
  64. }
  65. }
  66. return head;
  67. }
  69. //链表插入
  70. node * insert(node *head,int num)
  71. {
  72.     node *p,*q,*t;
  73.     p=head;
  74.     t=new node();
  75.     t->date=num;
  76. while(num>p->date&&p->next!=NULL)
  77. {
  78.         q=p;
  79.         p=p->next;
  80. }
  81. if(num<=p->date)
  82. {
  83. if(p==head)
  84. {
  85.             t->next=p;
  86.             head=t;
  87. }
  88. else
  89. {
  90.             t->next=p;
  91.             q->next=t;
  92. }
  93. }
  94. else//把插入点定在表尾
  95. {
  96.         p->next=t;
  97.         t->next=NULL;
  98. }
  99. return head;
  100. }
  102. //链表输出
  103. void print(node *head)
  104. {
  105. struct node *p=head;
  106. while(p!=NULL)
  107. {
  108. printf("%d\n",p->date);
  109.         p=p->next;
  110. }
  111. }
  113. //链表删除
  114. node *del(node *head,int num)
  115. {
  116.     node *p,*q;
  117.     p=head;
  118. while(num!=p->date&&p->next!=NULL)
  119. {
  120.         q=p;
  121.         p=p->next;
  122. }
  123. if(p->date==num)
  124. {
  125. if(p==head)
  126. {
  127.             head=p->next;
  128.             delete p;
  129. }
  130. else
  131. {
  132.             q->next=p->next;
  133.             delete p;
  134. }
  135. }
  136. else
  137. printf("Didn't Fond The Num!");
  138. return head;
  139. }
  141. //链表逆序
  142. node *reverse(node *head)
  143. {
  144.     node *p1,*p2,*p3;
  145.     p1=head;
  146.     p2=head->next;
  147. while(p2)
  148. {
  149.         p3=p2->next;
  150.         p2->next=p1;
  151.         p1=p2;
  152.         p2=p3;
  153. }
  154.     head->next=NULL;
  155.     head=p1;
  156. return head;
  157. }
  160. void main()
  161. {
  162. struct node *head;
  163. int n,m;
  165. printf("链表创建，输入数字:\n");
  166.     head=creat();
  167.     print(head);
  169.     n=lenght(head);
  170. printf("链表的长度为 %d\n",n);
  172. printf("链表排序:\n");
  173.     head=sort(head,n);
  174.     print(head);
  176. printf("输入要插入链表的数:\n");
  177. scanf("%d",&m);
  178. printf("插入后的链表:\n");
  179.     head=insert(head,m);
  180.     print(head);
  182. printf("链表逆序:\n");
  183.     head=reverse(head);
  184.     print(head);
  187. }

推荐阅读