栈c++实现

#include<iostream>


using namespace std;


class Stack{
public:
Stack(){top = -1;}
void push(int n){
if(!isfull())
data[++top] = n;
else
cout<<"栈已满"<<endl;
}
void pop(){
if(!isempty()){
cout<<"出栈元素为：“<< data[top]<<endl;
top--;
}
else
cout<<"栈为空"<<endl;
}

void size(){
cout<<"栈中元素个数为："<<top+1 <<endl;
}
bool isempty(){
return top == -1 ? true:false;
}
bool isfull(){
return top == 99 ? true : false;
}
private:
int data[100];
int top;
};




int main(){
Stack s;
s.push(2);
s.push(4);
s.push(6);
s.push(8);
s.size();
s.pop();
s.pop();
}