链表问题

Push

为什么insert插入结点，插入在头结点位置会有问题?求解:

1. 
   
2. /*****************************************/
   
3. /***********简单的数据链表程序************/
   
4. /*****************************************/
   
5. #include <stdio.h>
   
6. #include <conio.h>
   
7. #include <malloc.h>
   
8. #define LEA sizeof(struct student)
   
9. struct student
   
10. {
    
11. int num;
    
12. float score;
    
13. struct student *next;
    
14. };
    
15. struct student *expror();             //创建链表;
    
16. void print(struct student *head);           //打印链表;
    
17. struct student *del(struct student *head, int num);       //删除结点;
    
18. struct student *insert(struct student *head, struct student *p);   //插入结点;
    
19. void main()
    
20. {
    
21. struct student *p, *p1, *Max;
    
22. int n = 0;
    
23. 
    
24. p = expror();
    
25. print(p);
    
26. 
    
27. printf("Please input Number delete: ");
    
28. scanf("%d", &n);
    
29. print(del(p, n));
    
30. 
    
31. p1 = (struct student *)malloc(LEA);
    
32. printf("Please input Number insert: ");
    
33. scanf("%d", &p1->num);
    
34. printf("Please input Score insert: ");
    
35. scanf("%f", &p1->score);
    
36. Max = insert(p, p1);
    
37. print(Max);
    
38. getch();
    
39. }
    
40. struct student *expror()
    
41. {
    
42. struct student *p1, *p2, *head;
    
43. int n = 0;
    
44. head = NULL;
    
45. 
    
46. p1 = p2 = (struct student *)malloc(LEA);
    
47. printf("Please input Number: ");
    
48. scanf("%d", &p1->num);
    
49. printf("Please input Score: ");
    
50. scanf("%f", &p1->score);
    
51. 
    
52. while(p1->num)
    
53. {
    
54.   n++;
    
55.   if(1 == n)
    
56.   {
    
57.    head = p1;
    
58.   }
    
59.   else
    
60.   {
    
61.    p2->next = p1;
    
62.    p2 = p1;
    
63.   }
    
64.   p1 = (struct student *)malloc(LEA);
    
65.   printf("Please input Number: ");
    
66.   scanf("%d", &p1->num);
    
67.   printf("Please input Score: ");
    
68.   scanf("%f", &p1->score);
    
69. }
    
70. p2->next = NULL;
    
71. return head;
    
72. }
    
73. void print(struct student *head)
    
74. {
    
75. while(head != NULL)
    
76. {
    
77.   printf("Number = %d\t\tScore = %f\n", head->num, head->score);
    
78.   head = head->next;
    
79. }
    
80. }
    
81. struct student *del(struct student *head, int num)
    
82. {
    
83. struct student *p1, *p2;
    
84. p1 = head;
    
85. if(head == NULL)
    
86. {
    
87.   printf("Fuck you!!!");
    
88. }
    
89. else
    
90. {
    
91.   while(p1->next != NULL && p1->num != num)
    
92.   {
    
93.    p2 = p1;
    
94.    p1 = p1->next;
    
95.   }
    
96.   if(p1->num == num)
    
97.   {
    
98.    if(head == p1)
    
99.    {
    
100.     head = p1->next;
     
101.    }
     
102.    else
     
103.    {
     
104.     p2->next = p1->next;
     
105.    }
     
106.   }
     
107. }
     
108. return head;
     
109. }
     
110. struct student *insert(struct student *head, struct student *p)
     
111. {
     
112. struct student *p0, *p1, *p2;
     
113. p1 = head;
     
114. p0 = p;
     
115. if(head == NULL)
     
116. {
     
117.   printf("Fuck you!!!");
     
118. }
     
119. else
     
120. {
     
121.   while(p0->num > p1->num && p1->next != NULL)
     
122.   {
     
123.    p2 = p1;
     
124.    p1 = p1->next;
     
125.   }
     
126.   if(p0->num < p1->num)
     
127.   {
     
128.    if(head == p1)
     
129.    {
     
130.     head = p0;
     
131.     p0->next = p1;
     
132.    }
     
133.    else
     
134.    {
     
135.     p2->next = p0;
     
136.     p0->next = p1;
     
137.    }
     
138.   }
     
139.   else
     
140.   {
     
141.    p1->next = p0;
     
142.    p0->next = NULL;
     
143.   }
     
144. }
     
145. return head;
     
146. }

复制代码

wangyexin

插到头结点后 你要把头结点改为新结点

三天一打进北大

非常有问题。。。。

___光

student里的num是指的什么？

2004wmj

谢谢分享，非常喜欢！

2002wmj

写的很不错，谢谢分享

错过会难过

代码好乱...

错过会难过

代码加点注释啦,:mad:

恋色天空

把错误信息贴出来看看吧