-
Notifications
You must be signed in to change notification settings - Fork 0
/
顺序表.cpp
86 lines (85 loc) · 2.14 KB
/
顺序表.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
//*******************顺序表**********************
//!注意:下标从1计起
template<class T>
class MyArray{
protected:
T data[10001];
int MAXN;
int Size;
public:
MyArray(): Size(0), MAXN(10001){}
bool Push(T val) {
if(Size>10000) return false;
Size++;
data[Size]=val;
return true;
}
bool Modify(int pos, T val) {
if(pos>Size) return false;
data[pos]=val;
return true;
}
bool Insert(int pos,T val) {
if(pos>Size) return false;
Size++;
for(int i=Size;i>pos;i--)
data[i]=data[i-1];
data[pos]=val;
return true;
}
bool Delete(int pos) {
if(pos>Size) return false;
for(int i=pos;i<=Size-1;i++)
data[i]=data[i+1];
Size--;
return true;
}
T At(int pos) {
return data[pos];
}
int Find(T val) {
for(int i=1;i<=Size;i++)
if(val==data[i]) return i;
return -1;
}
void Display() {
for(int i=1;i<=Size;i++) cout<<data[i]<<" ";
cout<<endl;
}
int getSize(){return Size;}
~MyArray(){}
};
//********************************************************
//********************************************************
int main() {
int n;
cin>>n;
MyArray<int> v;
while(n--) {
int x;
cin>>x;
v.Push(x);
}
v.Display();
int pos,val;
cin>>pos>>val;
if(pos<1||pos>v.getSize()) cout<<"error"<<endl;
else {v.Insert(pos,val);v.Display();}
cin>>pos>>val;
if(pos<1||pos>v.getSize()) cout<<"error"<<endl;
else {v.Insert(pos,val);v.Display();}
cin>>pos;
if(pos<1||pos>v.getSize()) cout<<"error"<<endl;
else {v.Delete(pos);v.Display();}
cin>>pos;
if(pos<1||pos>v.getSize()) cout<<"error"<<endl;
else {v.Delete(pos);v.Display();}
cin>>pos;
if(pos<1||pos>v.getSize()) cout<<"error"<<endl;
else cout<<v.At(pos)<<endl;
cin>>pos;
if(pos<1||pos>v.getSize()) cout<<"error"<<endl;
else cout<<v.At(pos)<<endl;
return 0;
}
//*********************************************************