学生成绩双链表



1. #include<iostream>
2. using namespace std;
3. template < class student>
4. class Node
5. {
6. public:
7. student data;
8. Node<student> *prior;
9. Node<student> *next;
10. };
11. template < class student>
12. class DLL
13. {
14. public:
15. DLL(); //无参的构造函数
16. DLL(student score[], int n); //带参的构造函数
17. ~DLL(); //析构函数
18. int Length(); //返回单链表长度
19. void insert(int i, student x); //插入操作，在位置i插入元素
20. student get(int i); //按位查找
21. int locate(student x); //按值查找
22. student Delete(int i); //删除操作
23. void print(); //遍历操作
24. private:
25. Node<student> *first; //双链表的头指针
26. int length; //链的长度计数
27. };
28. template < class student>
29. DLL<student>::DLL(student score[], int n)
30. {
31. length= 0;
32. first= new Node<student>;
33. first->next= NULL;
34. first->prior= NULL;
35. for ( int i= 0;i<n;i++)
36. {
37. Node<student> *s= new Node<student>;
38. s->data=score[i];
39. s->next=first->next;
40. first->next = s;
41. }
42. }
43. template < class student>
44. DLL<student>::~DLL()
45. {
46. while (first->next!=first->prior)
47. {
48. //临时指针，存储即将释放的节点的指针
49. Node<student> *temp=first;
50. //脱链
51. first->prior->next=first->next;
52. first->next ->prior=first->prior;
53. //头指针后移
54. first=first->next;
55. //释放内存
56. delete temp;
57. }
58. delete first;
59. }
61. template< class student>
62. int DLL<student>::Length()
63. {
64. Node<student> *p;
65. int count;
66. p=first->next;
67. count= 0;
68. while(p!= NULL)
69. {
70. p=p->next;
71. count++;
72. }
73. return length;
74. }
76. template < class student>
77. void DLL<student>::insert( int i,student x)
78. {
79. Node<student>*p,*s;
80. int count;
81. p=first;
82. count= 0;
83. while(p!= NULL&&count<i -1)
84. {
85. p=p->next;
86. count++;
87. }
88. if(p== NULL) throw "位置";
89. else
90. {
91. s= new Node<student>;
92. s->data=x;
93. s->next=p->next;
94. p->next=s;
95. }
96. }
98. template < class student>
99. student DLL<student>::get( int i)
100. {
101. Node<student> *p; int count;
102. count= 1;
103. p=first->next;
104. while (p!= NULL&&count<i)
105. {
106. p = p->next;
107. count++;
108. }
109. if (p == NULL) throw "位置非法";
110. else return p->data;
111. }
113. template < class student>
114. int DLL<student>::locate(student x)
115. {
116. Node<student> *p;
117. int count;
118. p=first->next;
119. count= 1;
120. while(p!= NULL)
121. {
122. if(p->data==x) return count;
123. p=p->next;
124. count++;
125. }
126. return 0;
127. }
129. template < class student>
130. student DLL<student>::Delete( int i)
131. {
132. Node<student> *p,*q;
133. p=first->next;
134. int count, x;
135. count= 1;
136. while (p!= NULL&&count<i -1)
137. {
138. p=p->next;
139. count++;
140. }
141. if (p== NULL||p->next== NULL) throw "位置非法";
142. else
143. {
144. q=p->next;
145. x=q->data;
146. if (p->next!= NULL)
147. {
148. if(q->next!= NULL)
149. q->next->prior=p;
150. else
151. {
152. p->next= NULL;
153. p->next=q->next;
154. delete q;
155. q= NULL;
156. return x;
157. }
158. }
159. p->next=q->next;
160. delete q;
161. q= NULL;
162. return x;
163. }
164. }
166. template < class student>
167. void DLL<student>::print()
168. {
169. Node<student> *p;
170. p=first->next;
171. while(p->next!= NULL)
172. {
173. cout<<p->data<< " ";
174. p=p->next;
175. }
176. cout<<p->data<< endl;
177. }
178. int main()
179. {
180. float score[ 8] = { 72, 88, 57, 83.5, 32.5, 68, 96, 86.5};
181. DLL< float>Student(score, 8);
182. cout<< "初始成绩如下："<< endl;
183. Student.print();
184. cout<< endl<< "在学生3插入成绩86，插入后结果如下："<< endl;
185. Student.insert( 3, 86);
186. Student.print();
187. cout<< endl<< "在学生5删除成绩为："<<Student.Delete( 5)<< " , "<< "删除后结果如下:"<< endl;
188. Student.print();
189. cout<< endl<< "位置6的成绩为："<<Student.get( 6)<< endl;
190. cout<< endl<< "成绩72所在位置为："<<Student.locate( 72)<< endl<< endl;
191. cout<< "最终数据如下："<< endl;
192. Student.print();
193. cout<< endl;
194. return 0;
195. }