间接寻址



1. #include<iostream>
2. using namespace std;
3. const int Maxsize= 10;
4. template< class student>
5. struct Node {
6. student data;
7. Node<student> *next;
8. };
10. template< class student>
11. class inadd{
12. public:
13. inadd(); //无参构造函数
14. inadd(student score[], int n); //有参构造函数
15. ~inadd(); //析构函数
16. void print(); //遍历操作
17. student get(int i); //按位查找操作
18. int Locate(student x); //按值查找操作
19. void insert(int i,student x); //插入操作
20. student Delete(int i); //删除操作
21. bool changeList(int i,student x); //改变某一结点的值 i为节点的位置,x为替换的值
22. private:
23. Node<student> *first; //头指针
24. int length; //结点数量
25. Node<student> *address[Maxsize]; //结点指针数组
26. };
28. template< class student>
29. inadd<student>::inadd()
30. {
31. first= new Node<student>;
32. first->next= NULL;
33. }
35. template< class student>
36. inadd<student>::inadd(student score[], int n)
37. {
38. if (n>Maxsize) throw( "溢出");
39. Node<student> *s;
40. first= new Node<student>;
41. first->next= NULL; //初始化一个空链表
42. for( int i=n -1;i>= 0;i--)
43. {
44. s= new Node<student>;
45. s->data=score[i]; //为每个数组元素建立一个结点
46. s->next=first->next;
47. first->next=s; //将结点s插入头结点之后
48. }
49. }
51. template< class student>
52. inadd<student>::~inadd() //析构函数
53. {
54. Node<student> *q;
55. while(first!= NULL)
56. {
57. q=first;
58. first=first->next;
59. delete q;
60. }
61. }
63. template< class student>
64. void inadd<student>::insert( int i,student x)
65. {
66. Node<student>*p,*s; int count;
67. p=first;count= 0;
68. while(p!= NULL&&count<i -1)
69. {
70. p=p->next;
71. count++;
72. }
73. if(p== NULL) throw "位置非法";
74. s= new Node<student>;
75. s->data=x;
76. s->next=p->next;
77. p->next=s;
78. length++;
79. }
81. template< class student>
82. student inadd<student>::Delete( int i)
83. {
84. Node<student> *q,*p;
85. student x;
86. int count;
87. p=first;count= 0; //注意P指针要指向头结点
88. while(p!= NULL&&count<i -1) //此操作目的是找到i-1个结点
89. {
90. p=p->next;
91. count++;
92. }
93. if(p== NULL||p->next== NULL) throw "位置"; //结点p不存在或p后继结点不存在
94. else{
95. q=p->next;
96. x=q->data; //暂存被删结点
97. p->next=q->next;
98. delete q;
99. return x;
100. }
101. }
103. template< class student>
104. student inadd<student>::get( int i)
105. {
106. Node<student>*p; int count;
107. p=first->next;count= 1;
108. while(p!= NULL&&count<i)
109. {p=p->next;count++;}
110. if(p== NULL) throw "位置非法";
111. else return p->data;
112. }
114. template< class student>
115. int inadd<student>::Locate(student x)
116. {
117. Node<student>*p;
118. int count = 1;
119. p=first->next;
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. void inadd<student>::print()
131. {
132. Node<student>*p;
133. p=first->next;
134. while(p!= NULL)
135. { cout<<p->data<< " ";
136. p=p->next;
137. }
138. }
139. int main()
140. {
141. float score[ 5]={ 88.5, 52.5, 99, 73.5, 98};
142. inadd< float>Student(score, 5); //创建对象
143. cout<< "初始数据如下："<< endl;
144. Student.print();
145. cout<< endl<< "在位置5插入成绩95，结果如下："<< endl;
146. Student.insert( 5, 95);
147. Student.print();
148. cout<< endl<< "在学生2删除成绩为："<<Student.Delete( 2)<< endl<< "删除后结果如下:"<< endl;
149. Student.print();
150. cout<< endl<< "学生2的成绩为："<<Student.get( 3)<< endl;
151. cout<< endl<< "成绩99所在位置为："<<Student.Locate( 99)<< endl;
152. cout<< "最终数据如下："<< endl;
153. Student.print();
154. cout<< endl;
155. return 0;
156. }