数据结构中栈的实现与表现

顺序栈的实现：

/*顺序栈的实现*/
#include<iostream>
#include<stdlib.h>
using namespace std;


#define MAXSIZE 100
typedef struct 
{
int *base;
int *top;
int stacksize;
} SqStack;


/*顺序栈的初始化*/
int InitStack(SqStack &S)
{
//构造一个空栈
S.base = new int[MAXSIZE];
if(!S.base)
{
exit(0);
} 
S.top = S.base;//顺序栈为空的标志
S.stacksize = MAXSIZE;
return 1;
}


/*元素的入栈,将元素压入栈顶*/
int Push(SqStack &S,int e)
{
//插入元素e为新的栈顶元素 
if(S.top-S.base == S.stacksize)//栈满了
{
return 0;
} 
*S.top = e;
S.top++;
return 1;
} 


/*顺序栈的出栈*/
int Pop(SqStack &S,int &e)
{
//若栈不空，则删除栈顶元素，用e返回栈顶的值
if(S.top == S.base)
{
return 0;
} 
e = *S.top;
S.top--;
return 1;
} 


/*引用栈顶元素*/
int GetTop(SqStack S)
{
//若栈不空,返回栈顶元素
if(S.top == S.base)
{
return 0;
}
return *(S.top-1);
} 


/*顺序栈中元素的输出*/
int print_S(SqStack S)
{
int *p;
p = S.base;
while(p != S.top)
{
cout<<*p<<"\t";
p++;
}
cout<<endl<<endl;
} 


int main()
{

SqStack S;
InitStack(S);
int n;
cout<<"请输入压入栈的元素的个数，n = ";
cin>>n;
cout<<endl;
for(int i=1;i<=n;i++)
{
cout<<"请输入第"<<i<<"个元素的值：";
int m;
cin>>m;
Push(S,m); 
} 
print_S(S);

cout<<"出栈一次后："<<endl; 
int e;
Pop(S,e);
print_S(S);

cout<<"栈顶元素为："<<GetTop(S);
return 0;
} 

/*顺序栈的实现*/
#include<iostream>
#include<stdlib.h>
using namespace std;


#define MAXSIZE 100
typedef struct StackNode
{
int data;
struct StackNode *next;
} StackNode,*LinkStack;


/*链栈的初始化*/
int InitStack(LinkStack &S)
{
//没必要头节点，直接将栈顶赋空
S = NULL;
return 1;
}


/*元素的入栈,将元素压入栈顶*/
int Push(LinkStack &S,int e)
{
//插入元素e为新的栈顶元素 
LinkStack p;
p = new StackNode;
p->data = e;
p->next = S;
S = p;
return 1;
} 


/*链栈的出栈*/
int Pop(LinkStack &S,int &e)
{
//若栈不空，则删除栈顶元素，用e返回栈顶的值
if(S == NULL)
{
return 0;
}
e = S->data;
LinkStack p;
p = S;
S = S->next;
delete p;
return 1;
} 


/*引用栈顶元素*/
int GetTop(LinkStack S)
{
//若栈不空,返回栈顶元素
return S->data;
} 


/*链栈中元素的输出*/
int print_S(LinkStack S)
{
LinkStack p = S;
while(p != NULL)
{
cout<<p->data<<"\t";
p = p->next;
}
cout<<endl<<endl;
} 


int main()
{

LinkStack S;
InitStack(S);
int n;
cout<<"请输入压入栈的元素的个数，n = ";
cin>>n;
cout<<endl;
for(int i=1;i<=n;i++)
{
cout<<"请输入第"<<i<<"个元素的值：";
int m;
cin>>m;
Push(S,m); 
} 
print_S(S);
cout<<"栈顶元素为："<<GetTop(S)<<endl<<endl;

cout<<"出栈一次后："<<endl; 
int e;
Pop(S,e);
print_S(S);

cout<<"栈顶元素为："<<GetTop(S);
return 0;
}