-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path53.cpp
88 lines (80 loc) · 1.28 KB
/
53.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
#include<iostream>
using namespace std;
class Myarray
{
public:
int *alist;
int length;
Myarray(int len);
~Myarray();
void input();
void display();
};
Myarray::Myarray(int len)
{
cout<<"Constructing"<<endl;
alist=new int[len+1];
length=len;
}
Myarray::~Myarray()
{
if(alist)
{
delete []alist;
length =0;
}
cout<<"Distructing"<<endl;
}
void Myarray::input()
{
if(alist)
{
cout<<"Please input"<<length<<"numbers"<<endl;
for(int i=0;i<length;i++)
cin>>alist[i];
}
}
void Myarray::display()
{
for(int i=0;i<length;i++)
cout<<alist[i]<<" ";
cout<<endl;
}
class Revarray: public Myarray//类Revarray继承自myarray,
{
public:
Revarray(int n):Myarray(n)
{
cout<<"Revarray Constructing"<<endl;
}
~Revarray()
{
cout<<"Revarray Destructing"<<endl;
}
void Reverse()
{
cout<<"The original Revarray"<<endl;
display();
for(int i=0; i<(length)/2; i++)
{
int temp=alist[i];
alist[i]=alist[length-1-i];
alist[length-1-i]=temp;
}
cout<<"The recent Revarray"<<endl;
display();
}
void display()
{
for(int i=0; i<length; i++)
cout<<alist[i]<<" ";
cout<<endl;
}
};
int main()
{
Revarray r1(10);
r1.input();
r1.Reverse();
return 0;
}