一个复制构造函数填程?进来测试一下你的智商!please

[btw505]

#include <iostream.h>
#define MAX_LEN 10 //栈的最大长度

class Stack
{private:
int *piBuffer;
int iTop;
public:
Stack();
~Stack();
Stack(int size);
Stack(const Stack&)
void push(int);
int pop();
bool isFull(Stack &);//判断栈为满
bool isEmpty(Stack &);//判断栈为空
};

......

int main()
{Stack c(10);
c.push(1);
c.push(2);
Stack c1=c;
cout<<c1.pop()<<endl;
cout<<c1.pop()<<endl;
return 0;
}



谁能帮我写写其中函数的代码啊,我写的是错的,实现的功能就是把一个size大小的一个栈,用复制构造函数把c复制c1;再输出,你们帮帮我行不?

[beysion]

#include <iostream.h>
#include <stdlib.h>
#include <string.h>
#define MAX_LEN 20

class Stack //一个栈
{
public:
Stack();
Stack(int size);
~Stack();
void push(char);
Stack(const Stack&);
char pop();
bool IsEmpty();
bool IsFull();

private:
char *piBuffer;
int iTop;
};

Stack::Stack()
{
piBuffer=NULL;
iTop=-1;
}

Stack::Stack(int size)
{
piBuffer=new char[size];
iTop=-1; ////////////这里是加的一句
}

Stack::~Stack()
{
delete[] piBuffer;
}

void Stack::push(char c)
{
if(IsFull())
{
cerr<<"此栈已满!"<<endl;
exit(1);
}
piBuffer[++iTop]=c;
}

char Stack::pop()
{
if(IsEmpty())
{
cerr << "此栈已为空!!"<< endl;
exit(2);
}
return piBuffer[iTop--];
}

bool Stack::IsEmpty()
{
return (iTop==-1);
}

bool Stack::IsFull()
{
return (iTop==MAX_LEN-1);
}

Stack::Stack(const Stack& r):iTop(r.iTop)
{

piBuffer= new char[MAX_LEN];

strcpy(piBuffer,r.piBuffer);
}



int main()
{
Stack c(MAX_LEN);

c.push('1');
c.push('2');
Stack c1(c);
cout<<c1.pop()<<endl;
cout<<c1.pop()<<endl;

return 0;
}