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;
}
總結
本篇文章就到這裡瞭，希望能夠給你帶來幫助，也希望您能夠多多關註WalkonNet的更多內容!