C++实现数据结构的顺序表详解
程序员文章站
2022-06-22 07:59:12
目录前言:代码1.seqlist.h2.seqlist.cpp3.test.cpp总结前言:hello,大家好,这篇文章博主来分享一下c++实现数据结构中的顺序表的代码。希望对大家有所帮助。在博主之前...
前言:
hello,大家好,这篇文章博主来分享一下c++实现数据结构中的顺序表的代码。希望对大家有所帮助。
在博主之前的文章中,已经详细地写过顺序表,读者可以点击查看c语言如何建立链表并实现增删查改,在之前的文章中,是用c语言来实现的,这篇文章中,我们用c++来实现。
代码
1.seqlist.h
#ifndef seqlist_h #define seqlist_h #include<iostream> using namespace std; template<class t,int maxsize> class seqlist { t data[maxsize]; int length; public: seqlist(); seqlist(t a[],int n); ~seqlist(); int listlength(); t get(int pos); int locate(t item); void seqprint(); void insert(int i, t item); t delete(int i); }; #endif
2.seqlist.cpp
#define _crt_secure_no_warnings 1 #include"seqlist.h" template<class t, int maxsize> seqlist<t,maxsize>::seqlist() { length = 0; } template<class t, int maxsize> seqlist<t, maxsize>::seqlist(t a[], int n) { if (n < maxsize) { length = n; for (int i = 0; i < n; i++) { data[i] = a[i]; } } else { cerr << "您的数据已经超过范围,系统无法继续工作" << endl; exit(-1); } } template<class t, int maxsize> seqlist<t, maxsize>::~seqlist() { } template<class t, int maxsize> int seqlist<t, maxsize>::listlength() { return length; } template<class t, int maxsize> t seqlist<t, maxsize>::get(int pos) { if (pos > length || pos < 0) { cerr << "您要查找的位置不存在,系统无法继续为您服务" << endl; exit(-1); } else { return data[pos - 1]; } } template<class t, int maxsize> int seqlist<t, maxsize>::locate(t item) { for (int i = 0; i < length; i++) { if (data[i] == item) return i + 1; } return -1; } template<class t, int maxsize> void seqlist<t, maxsize>::seqprint() { for (int i = 0; i < length; i++) { cout << data[i] << " "; } cout << endl; } template<class t, int maxsize> void seqlist<t, maxsize>::insert(int i, t item) { if (length < maxsize) { for (int j = length - 1; j>=i - 1; j--) { data[j + 1] = data[j]; } data[i - 1] = item; length++; } else { cerr << "抱歉,当前已经达到系统最大的储存,无法为您插入" << endl; exit(-1); } } template<class t, int maxsize> t seqlist<t, maxsize>::delete(int i) { if (length == 0) { cerr << "当前无可删除元素" << endl; exit(-1); } if (i<1 || i>length) { cerr << "该位置非法" << endl; exit(-1); } t x = data[i - 1]; for (int j = i; j < length; j++) { data[j - 1] = data[j]; } length--; return x; }
3.test.cpp
#define _crt_secure_no_warnings 1 #include"seqlist.cpp" #include<iostream> using namespace std; void menu() { cout << "|------------------------------------|" << endl; cout << "|----------- 欢迎来到顺序表 ---------|" << endl; cout << "|---------------1.插入---------------|" << endl; cout << "|---------------2.删除---------------|" << endl; cout << "|---------------3.求长---------------|" << endl; cout << "|---------------4.取值---------------|" << endl; cout << "|---------------5.定位---------------|" << endl; cout << "|---------------6.打印---------------|" << endl; cout << "|---------------0.退出---------------|" << endl; cout << "|------------------------------------|" << endl; } int main() { int *a; int n; cout << "请输入您要构造的顺序表的长度" << endl; cin >> n; a = new int[n]; cout << "请输入该顺序表中的每一个元素" << endl; for (int i = 0; i < n; i++) { cin >> a[i]; } seqlist<int, 20>seq(a, n); cout << "现在开始我们的程序之旅" << endl; int input=0; do { menu(); cout << "输入您要进行的操作的编号" << endl; cin >> input; switch (input) { case 1: cout << "请输入您要插入的位置和数值" << endl; int pos; int value; cin >> pos; cin >> value; seq.insert(pos,value); break; case 2: cout << "请输入您要删除的位置" << endl; int pos1; cin >> pos1; cout << "您删除的元素的值为:"; cout << seq.delete(pos1) << endl; break; case 3: cout << "您的顺序表当前的长度为:" << seq.listlength() << endl; break; case 4: cout << "请输入您要查找的位置" << endl; int pos2; cin >> pos2; cout << "您查找的元素的值为:"; cout << seq.get(pos2) << endl;; break; case 5: cout << "请输入您要查找的元素" << endl; int item; cin >> item; cout << "您查找的元素的位置为:"; cout << seq.locate(item) << endl;; break; case 6: cout << "当前顺序表如下:" << endl; seq.seqprint(); break; case 0: cout << "程序退出,感谢使用" << endl; exit(-1); break; default : cout << "您的输入有误,请重新选择" << endl; } } while (input); return 0; }
总结
本篇文章就到这里了,希望能够给你带来帮助,也希望您能够多多关注的更多内容!
上一篇: 括号生成
下一篇: C# winform滚动字幕效果