有如下程序:
#include <iostream>
using namespace std;
class Stack
public:
Stack(unsigned n= 10):size(n) rep_=ew int[size];
top=0;
Stack(Stack& s):size(s.size)
rep_=new int[size];
for(int i=0;i<size;i++) rep_[i]=s.rep_[i];
top=s.top;
~Stack() delete []rep_;
void push(int
A.rep_[top]=a; top++;
&n