用链表来现实栈的操作

*****实现用链表来现实栈的操作

#include<iostream>
using namespace std;


struct student
{
char name[20];
student *next;
};


struct zhan
{
int num;
zhan *next;
student *top,*bottle;
};




zhan* create(int n)
{
zhan *head,*p;
head=(zhan*)malloc(sizeof(zhan));
p=head;
zhan *s;//用来循环
int i=1;
while(i<=n)//这么多的栈
{
s=(zhan*)malloc(sizeof(zhan));
s->num=i;
p->next=s;
p=s;
i++;
}
p->next=NULL;//垂悬
head=head->next;//正式的第一个有用的
return head;
}




template<class T>
int length(T *head)
{
int n=0;
T* p=head;
while(p)
{
p=p->next;
n++;
}
return n;
}




void print_zhan(zhan* head)
{
zhan* p=head;
while(p)
{
cout<<p->num<<"  ";
p=p->next;
}
cout<<endl;
}




void print_student(student *head)
{
student *p=head;
while(p)
{
cout<<p->name<<"  ";
p=p->next;
}
cout<<endl;
}


zhan *insert(zhan *head,int n)//插入n个学生
{
head->top=head->bottle=NULL;//初始化，防止垂悬
if(n==0)//没有要插入的
return head;
int i=1;
student *s;
while(i<=n)
{
cout<<"给第"<<i<<"个学生输入名字："<<endl;
s=(student*)malloc(sizeof(student));
cin>>s->name;
if(head->bottle==NULL)
{
head->top=s;
head->bottle=s;
}
else
{
head->top->next=s;//这里很关键，需要将top当做链表的尾端
head->top=s;
}
i++;
}
head->top->next=NULL;//防止悬空
return head;
}




zhan* chuzhan(zhan* head,int n)//n个人出栈
{
int len=length(head->bottle );//计算出这个栈的学生人数
student *p=head->bottle;
for(int i=1;i<len-n;i++)
p=p->next;//确定到要删除的结点
if(head->bottle==head->top )
{
head->bottle=head->top=NULL;
}
else
p->next=NULL;
return head;
}


int main(void)
{
int number;


cout<<"输入多少个栈："<<endl;
cin>>number;


zhan *head;
head=create(number);//创建栈
cout<<"栈的信息如下："<<endl;
print_zhan(head);//输出栈的信息

int len=length(head);
cout<<endl;
zhan *p=head;
for(int i=1;i<=len;i++)
{
cout<<"给第"<<i<<"个栈初始化多少学生："<<endl;
cin>>number;
insert(p,number);
p=p->next;//不然后面就将只会有一个栈了,因为只剩下最后一个了
}


cout<<endl;
p=head;
for(int i=1;i<=len;i++)
{
cout<<"第"<<i<<"个栈的初始化信息如下："<<endl;
print_student(p->bottle);
p=p->next;
}




cout<<endl;
p=head;
for(int i=1;i<=len;i++)
{
cout<<"给第"<<i<<"个栈出栈多少学生："<<endl;
cin>>number;
chuzhan(p,number);//栈的操作是先进后出
p=p->next;
}




cout<<endl;
p=head;
for(int i=1;i<=len;i++)
{
cout<<"第"<<i<<"个栈的初始化信息如下："<<endl;
print_student(p->bottle);
p=p->next;
}


return 0;
}