第六周项目2—链栈的算法库建立

问题及代码烟台大学计算机学院 *文件名称：链栈算法库.cpp*作者：郗传秀*完成日期；2016年9月29日**问题描述：　定义链栈存储结构，实现其基本运算，并完成测试*输入描述：测试栈的数据*程序输出：测试结果*///main.cpp#include <stdio.h>#include <malloc.h>#include"listack.h"int main(){ElemType e;LiStack *s;printf("(1)初始化链栈s\n");InitStack(s);printf("(2)链栈为%s\n",(StackEmpty(s)?"空":"非空"));printf("(3)依次进链栈元素a,b,c,d,e\n");Push(s,'a');Push(s,'b');Push(s,'c');Push(s,'d');Push(s,'e');printf("(4)链栈为%s\n",(StackEmpty(s)?"空":"非空"));printf("(5)链栈长度:%d\n",StackLength(s));printf("(6)从链栈顶到链栈底元素:");DispStack(s);printf("(7)出链栈序列:");while (!StackEmpty(s)){ Pop(s,e);printf("%c ",e);}printf("\n");printf("(8)链栈为%s\n",(StackEmpty(s)?"空":"非空"));printf("(9)释放链栈\n");DestroyStack(s);return 0;}//listack.cpp#include <stdio.h>#include <malloc.h>#include "listack.h"void InitStack(LiStack *&s) //初始化栈{s=(LiStack *)malloc(sizeof(LiStack));s->next=NULL;}void DestroyStack(LiStack *&s) //销毁栈{LiStack *p=s->next;while (p!=NULL){free(s);s=p;p=p->next;}free(s); //s指向尾结点,释放其空间}int StackLength(LiStack *s) //返回栈长度{int i=0;LiStack *p;p=s->next;while (p!=NULL){i++;p=p->next;}return(i);}bool StackEmpty(LiStack *s) //判断栈是否为空{return(s->next==NULL);}void Push(LiStack *&s,ElemType e) //入栈{LiStack *p;p=(LiStack *)malloc(sizeof(LiStack));p->data=e; //新建元素e对应的节点*pp->next=s->next; //插入*p节点作为开始节点s->next=p;}bool Pop(LiStack *&s,ElemType &e) //出栈{LiStack *p;if (s->next==NULL) //栈空的情况return false;p=s->next; //p指向开始节点e=p->data;s->next=p->next; //删除*p节点free(p); //释放*p节点return true;}bool GetTop(LiStack *s,ElemType &e) //取栈顶元素{if (s->next==NULL) //栈空的情况return false;e=s->next->data;return true;}void DispStack(LiStack *s) //输出栈中元素{LiStack *p=s->next;while (p!=NULL){printf("%c ",p->data);p=p->next;}printf("\n");}//listack.htypedef char ElemType;typedef struct linknode{ElemType data; //数据域struct linknode *next; //指针域} LiStack; //链栈类型定义void InitStack(LiStack *&s); //初始化栈void DestroyStack(LiStack *&s); //销毁栈int StackLength(LiStack *s); //返回栈长度bool StackEmpty(LiStack *s); //判断栈是否为空void Push(LiStack *&s,ElemType e); //入栈bool Pop(LiStack *&s,ElemType &e); //出栈bool GetTop(LiStack *s,ElemType &e); //取栈顶元素void DispStack(LiStack *s); //输出栈中元素

<span style="font-family: Consolas, 'Courier New', Courier, mono, serif; line-height: 18px;"><span style=</span><span class="string" style="margin: 0px; padding: 0px; border: none; color: blue; font-family: Consolas, 'Courier New', Courier, mono, serif; line-height: 18px;">"font-family:Arial;BACKGROUND-COLOR: #ffffff"</span><span style="margin: 0px; padding: 0px; border: none; font-family: Consolas, 'Courier New', Courier, mono, serif; line-height: 18px;">></span> </span>

运行结果