链栈是在链表基础上建立的,链栈的栈顶指针相当于链表中的头指针。示意图如下:
#include "stdafx.h"
#include<iostream>
typedef int type;
using namespace std;
typedef struct stack
{
type data;
struct stack *next;
}stack,*ChainStack;
//建立空栈函数
ChainStack CreateChainStack(ChainStack s)
{
s=(ChainStack)malloc(sizeof(stack)); //相当于链表的头结点
if(NULL==s)
{
return NULL;
}
s->data=-1;
s->next=NULL;
return s;
}
//入栈
ChainStack Push(ChainStack s,type data)
{
ChainStack temp=(ChainStack)malloc(sizeof(stack));
if(NULL==temp)
{
cout<<"申请内存失败!"<<endl;
exit(-1);
}
temp->data=data;
temp->next=s->next;
s->next=temp;
return s;
}
//计算链栈的长度
int LengthStack(ChainStack s)
{
int i=0;
ChainStack temp=s->next;
while(NULL!=temp)
{
i++;
temp=temp->next;
}
return i;
}
//出栈
ChainStack Pop(ChainStack s)
{
ChainStack temp;
int len=LengthStack(s);
if(NULL==s->next)
{
return NULL;
}
temp=s->next;
s->next=temp->next;
return temp;
}
//打印链栈中的元素
void PrintSatck(ChainStack s)
{
ChainStack temp=s->next;
if(NULL==s->next)
{
exit(-1);
}
while(NULL!=temp)
{
cout<<temp->data<<" ";
temp=temp->next;
}
cout<<endl;
}
int _tmain(int argc, _TCHAR* argv[])
{
int a[6]={20,22,24,26,28,30};
ChainStack s=NULL;
s=CreateChainStack(s);
for(int i=0;i<6;i++)
Push(s,a[i]);
PrintSatck(s);
ChainStack tp=Pop(s);
cout<<tp->data<<endl;
return 0;
}
运行结果为: