📄 data_struct/顺序表.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <iostream>
using namespace std;
template <class T, int N>
class SeqList
{
public:
SeqList() { length = 0; }
SeqList(T a[], int n);
int GetLength() { return length; }
void PrintList();
void Insert(int i, T x);
T Delete(int i);
T Get(int i);
int Locate(T x);
T middleNode();
bool checkCycle();
private:
T data[N];
int length;
};
template <class T, int N>
SeqList<T, N>::SeqList(T a[], int n)
{
if (n > N)
throw "数组长度超过最大限制";
for (int i = 0; i < n; i++)
data[i] = a[i];
length = n;
}
template <class T, int N>
void SeqList<T, N>::PrintList()
{
for (int i = 0; i < length; i++)
cout << data[i] << " ";
cout << endl;
}
template <class T, int N>
void SeqList<T, N>::Insert(int i, T x)
{
if (length + 1 > N)
throw "超出最大长度";
if (i < 1 || i >= length + 1) // 细节
throw "位置异常";
for (int j = length; j >= i; j--)
{
data[j] = data[j - 1];
}
data[i] = x;
length++;
}
template <class T, int N>
T SeqList<T, N>::Delete(int i)
{
if (length == 0)
throw "溢出"; // 要先 判断是否为空，保证报错信息准确
if (i < 1 || i > length)
throw "位置异常";
T x = data[i - 1];
for (int j = i; j < length; j++)
{
data[j - 1] = data[j];
}
length--;
return x;
}
template <class T, int N>
T SeqList<T, N>::Get(int i)
{
if (i < 1 || i > length)
throw "位置异常";
return data[i - 1];
}
template <class T, int N>
int SeqList<T, N>::Locate(T x)
{
int ans = 0;
for (int i = 0; i < length; i++)
{
if (data[i] == x) // 注意除了基本数据类型外，需要对==进行重载
{
ans = i + 1;
break;
}
}
return ans;
}