给大家发福利，循序表“类”及应用

刹那芳华

1. #include <iostream>
   
2. 
   
3. using namespace std;
   
4. template <class T>
   
5. class SeqList;
   
6. 
   
7. 
   
8. template <class T>
   
9. class SeqList
   
10. {
    
11. public:
    
12. T *element;
    
13. int size;
    
14. int len;
    
15. public:
    
16. SeqList(int size = 64);
    
17. SeqList(T value[],int n);
    
18. ~SeqList();
    
19. bool isEmpty();
    
20. int length();
    
21. T get(int i);
    
22. bool set(int i,T x);
    
23. /* void display(SeqList<T> &list)
    
24. {
    
25. for(int i=0;i<list.len;i++)
    
26. {
    
27. cout<<element[i]<<",";
    
28. }
    
29. }*/
    
30. friend ostream& operator << (ostream&,const SeqList<T>&);
    
31. void insert(int i,T x);
    
32. void insert(T x);
    
33. bool remove(int i,T& old);
    
34. void clear();
    
35. };
    
36. template <class T>
    
37. SeqList<T>::SeqList(int size)
    
38. {
    
39. this->size = size<64?64:size;
    
40. this->element = new T[this->size];
    
41. this->len = 0;
    
42. }
    
43. template <class T>
    
44. SeqList<T>::SeqList(T value[],int n)
    
45. {
    
46. if(n>0)
    
47. {
    
48. this->element = new T[2*n];
    
49. this->size = 2*n;
    
50. for(int i=0;i<n;i++)
    
51. this->element[i] = value[i];
    
52. this->len = n;
    
53. }
    
54. };
    
55. template <class T>
    
56. ostream & operator<<(ostream & out,SeqList<T> &list)
    
57. {
    
58. out<<"(";
    
59. if(list.len>0)
    
60. {
    
61. out<<list.element[0];
    
62. for(int i = i;i<list.len;i++)
    
63. out<<","<<list.element[i];
    
64. }
    
65. out<<")\n";
    
66. return out;
    
67. }
    
68. template <class T>
    
69. SeqList<T>::~SeqList()
    
70. {
    
71. delete []this->element;
    
72. }
    
73. template <class T>
    
74. bool SeqList<T>::isEmpty()
    
75. {
    
76. return len == 0;
    
77. }
    
78. template <class T>
    
79. int SeqList<T>::length()
    
80. {
    
81. return len;
    
82. }
    
83. template <class T>
    
84. T SeqList<T>::get(int i)
    
85. {
    
86. if(i>=0&&i<len)
    
87. return element[i];
    
88. throw "参数i指定的元素序号无效";
    
89. }
    
90. template <class T>
    
91. bool SeqList<T>::set(int i,T x)
    
92. {
    
93. if(i>=0&&i<len)
    
94. {
    
95. element[i] = x;
    
96. return true;
    
97. }
    
98. return false;
    
99. };
    
100. 
     
101. 
     
102. template <class T>
     
103. void SeqList<T>::insert(int i, T x)
     
104. {
     
105. if(len==size)
     
106. {
     
107. T *temp = element;
     
108. element = new T[size*2];
     
109. for(int i=0;i<size;i++)
     
110. element[i]=temp[i];
     
111. //size* = 2;
     
112. }
     
113. if(i<0) i = 0;
     
114. if(i>len) i = len;
     
115. for(int j = len-1;j>=i;j--)
     
116. element[j+1]=element[i];
     
117. element[i] = x;
     
118. len++;
     
119. }
     
120. template <class T>
     
121. void SeqList<T>::insert(T x)
     
122. {
     
123. insert(len,x);
     
124. }
     
125. template <class T>
     
126. bool SeqList<T>::remove(int i,T &old)
     
127. {
     
128. if(len>0&&i>=0&&i<len)
     
129. {
     
130. old = element[i];
     
131. for(int j = i;j<len;j++)
     
132. element[j] = element[j+1];
     
133. len--;
     
134. return true;
     
135. }
     
136. return false;
     
137. }
     
138. template <class T>
     
139. void SeqList<T>::clear()
     
140. {
     
141. len = 0;
     
142. }

复制代码

上面是顺序表类
下面是调用这个类解决问题，比如约瑟夫环问题，这只是举个例子，还可以有很多用法

1. 
   
2. 
   
3. #include "SeqList.h"
   
4. void josephus(int number,int start,int distance)
   
5. {
   
6. SeqList<char> jose(number);
   
7. int i=0;
   
8. for(i = 0;i<number;i++)
   
9. {
   
10.   jose.insert('A'+i);
    
11. }
    
12. cout<<"约瑟夫环("<<number <<","<<start<<","<<distance<<"),"<<jose;
    
13. i = start;
    
14. while(jose.length()>1)
    
15. {
    
16.   i = (i+distance - 1)%jose.length();
    
17.   char old;
    
18.   if(jose.remove(i,old))
    
19.    cout<<"删除"<<old<<",";
    
20.    cout<<jose;
    
21. }
    
22. cout<<"被赦免的是"<<jose.get(0)<<"\n";
    
23. }
    
24. int main()
    
25. {
    
26.     josephus(5,0,2);
    
27.     return 0;
    
28. }

复制代码

刹那芳华

2楼还是我的，有问题大家可以互相交流

復襍

路过看一看有什么好东西收藏一下，强烈支持楼主ing……37733

hesongnian123

学习了学习了

轻云流风

顶起，代码真整洁，如在加一点注释就更完美了

icecool

学习了 ~~~~