#include <iostream>
#define STACKINITSIZE 100//初始化空间分配量
using namespace std;
struct Stack{
int* base;
int* top;
int stackSize;
};
void createStack(Stack* s){//创建并初始化
s->top=s->base=new int[STACKINITSIZE];
s->stackSize=STACKINITSIZE;
}
int emptyS(Stack* s){
if(s->top==s->base&&(s->top-s->base!=STACKINITSIZE)){//占顶和栈底相等并且不是栈满的情况
return 1;
}
else {
return 0;
}
}
int pop(Stack* s){//出栈
if (emptyS(s))
return -1;
else{
s->top--;
return *(s->top);
}
}
void destroy(Stack* s){//销毁栈
delete s;
}
Stack* push(Stack* s,int elem){
if((s->top-s->base)==s->stackSize){//栈满
Stack* s1=new Stack();
s1->base=s1->top=new int[STACKINITSIZE+50];//重新分配空间
s1->stackSize=STACKINITSIZE+50;
int* base1=s->base;
while(s->top!=base1){//复制元素到新空间
*(s1->top)=*base1;
s1->top++;
base1++;
}
*(s1->top)=*base1;
*(s1->top)=elem;
s1->top++;
return s1;
}
else{//正常入栈
*(s->top)=elem;
s->top++;
return s;
}
}
int main(){
Stack* s=new Stack();
createStack(s);
for(int i=1;i<5;i++){
push(s,i);
}
cout<<pop(s);
destroy(s);
}
#define STACKINITSIZE 100//初始化空间分配量
using namespace std;
struct Stack{
int* base;
int* top;
int stackSize;
};
void createStack(Stack* s){//创建并初始化
s->top=s->base=new int[STACKINITSIZE];
s->stackSize=STACKINITSIZE;
}
int emptyS(Stack* s){
if(s->top==s->base&&(s->top-s->base!=STACKINITSIZE)){//占顶和栈底相等并且不是栈满的情况
return 1;
}
else {
return 0;
}
}
int pop(Stack* s){//出栈
if (emptyS(s))
return -1;
else{
s->top--;
return *(s->top);
}
}
void destroy(Stack* s){//销毁栈
delete s;
}
Stack* push(Stack* s,int elem){
if((s->top-s->base)==s->stackSize){//栈满
Stack* s1=new Stack();
s1->base=s1->top=new int[STACKINITSIZE+50];//重新分配空间
s1->stackSize=STACKINITSIZE+50;
int* base1=s->base;
while(s->top!=base1){//复制元素到新空间
*(s1->top)=*base1;
s1->top++;
base1++;
}
*(s1->top)=*base1;
*(s1->top)=elem;
s1->top++;
return s1;
}
else{//正常入栈
*(s->top)=elem;
s->top++;
return s;
}
}
int main(){
Stack* s=new Stack();
createStack(s);
for(int i=1;i<5;i++){
push(s,i);
}
cout<<pop(s);
destroy(s);
}