单链表简单操作一

下面简单的进行单链表的插入删除销毁等操作，想重点的说一下，关于链表插入的时候，分为三种情况，不过原理都一样。在尾插的时候，我们没有遍历链表，不清楚链表的长度，如何判断for循环如何终止呢？

点击(此处)折叠或打开

1. 
   
2. #include
   
3. using namespace std;
   
4. struct List {
   
5. 
   
6. 
   
7. int data;
   
8. struct List *next;
   
9. };
   
10. 
    
11. 
    
12. List *CreateFirst() {
    
13. 
    
14. 
    
15. List *first;
    
16. first = new List;
    
17. first->next = NULL;
    
18. return first;
    
19. }
    
20. 
    
21. 
    
22. List *InitialList(List *first) { //用尾插法创建链表，并赋值
    
23. 
    
24. 
    
25. List *p, *head;
    
26. head = first;
    
27. /* 首插法创建链表
    
28. for (int i = 0; i < 10; i++) {
    
29. p = new List;
    
30. p->data = i;
    
31. p ->next = first ->next;
    
32. first ->next = p;
    
33. 
    
34. }**/
    
35. 
    
36. for (int i = 0; i < 10; i++) {
    
37. p = new List;
    
38. p->data = i;
    
39. head->next = p;
    
40. head = p;
    
41. head->next = NULL;
    
42. }
    
43. return first;
    
44. }
    
45. 
    
46. 
    
47. void PrintList(List *first) {
    
48. 
    
49. 
    
50. do {
    
51. 
    
52. 
    
53. first = first->next;
    
54. cout << first->data << " ";
    
55. 
    
56. } while (first != NULL);
    
57. }
    
58. 
    
59. 
    
60. int PrintLength(List *first) {
    
61. 
    
62. 
    
63. int i = 0;
    
64. for (List *q = first; q !=NULL ; q = q->next) {
    
65. 
    
66. 
    
67. i++;
    
68. }
    
69. return i-1;
    
70. }
    
71. 
    
72. 
    
73. int Delete(List *first, int i) {
    
74. 
    
75. 
    
76. List *s;
    
77. int ddata;
    
78. int count = 0;
    
79. for (int j = 0; j < i - 1; j++) {
    
80. 
    
81. 
    
82. first = first->next;
    
83. count++;
    
84. }
    
85. 
    
86. 
    
87. s = first->next;
    
88. ddata = (*s).data;
    
89. first->next = s->next;
    
90. delete s;
    
91. return ddata;
    
92. }
    
93. 
    
94. 
    
95. void InsertList(List *first, int i, int x) {
    
96. 
    
97. 
    
98. /*    List *s; // 插入链表首部
    
99. int ddata;
    
100. s = new List;
     
101. s->data = x;
     
102. s->next = first->next;
     
103. first->next = s; */
     
104. 
     
105. 
     
106. /*    List *s; //插入两结点之间
     
107. int ddata;
     
108. for (int j = 0; j < i - 1; j++) {
     
109. 
     
110. 
     
111. first = first->next;
     
112. }
     
113. s = new List;
     
114. s->data = x;
     
115. s->next = first->next;
     
116. first->next = s; */
     
117. 
     
118. 
     
119. List *s; // 插入链表尾部
     
120. int ddata;
     
121. for (; first->next != NULL; first = first->next);
     
122. s = new List;
     
123. s->data = x;
     
124. s->next = first->next;
     
125. first->next = s;
     
126. 
     
127. }
     
128. 
     
129. 
     
130. void DestroyList(List *first) {
     
131. 
     
132. 
     
133. while (first != NULL) {
     
134. List *s;
     
135. s = first;
     
136. first = first->next;
     
137. delete s;
     
138. }
     
139. }
     
140. void main() {
     
141. 
     
142. 
     
143. List *s, *t;
     
144. s = CreateFirst();
     
145. t = InitialList(s);
     
146. cout << Delete(t, 3) << endl;
     
147. //InsertList(t, 3, 11);
     
148. PrintList(t);
     
149.  DestroyList(t);
     
150. 
     
151. }
152. 
     

由本人水平有限，有错误之处，请大家指正！

来自 “ ITPUB博客 ” ，链接：http://blog.itpub.net/29876893/viewspace-1814392/，如需转载，请注明出处，否则将追究法律责任。

转载于:http://blog.itpub.net/29876893/viewspace-1814392/