棧，是操作受限的線性表，只能在一端進(jìn)行插入刪除。

其實(shí)就是帶尾指針的鏈表，尾插

#include <stdio.h> #include <stdlib.h> #define OK 1 #define ERROR 0 #define Status int #define SElemType int //只在頭部進(jìn)行插入和刪除(不帶頭結(jié)點(diǎn)) typedef struct LNode {SElemType data;struct LNode *next; }LNode, *LinkList;typedef struct {LNode *top;LNode *base;int length; }LinkStack;Status InitStack(LinkStack &S) {S.base = NULL;S.top = NULL;S.length = 0;return OK; }Status GetTop(LinkStack S, SElemType &e) {if(S.length == 0)return ERROR;e = S.top->data ;return OK; }Status Push(LinkStack &S, SElemType e) {LNode *newNode = (LNode *)malloc(sizeof(LNode));newNode->data = e;newNode->next = S.top;S.top = newNode;if(!S.base)S.base = newNode;++S.length;return OK; }Status Pop(LinkStack &S, SElemType &e) {LNode *p = S.top;if(S.length == 0)return ERROR;e = S.top->data;S.top = S.top->next;free(p);--S.length;return OK; }void PrintStack(LinkStack S) {LNode *p = S.top;printf("由棧頂?shù)綏５?#xff1a;");while (p){printf("%d ",p->data);p = p->next;}printf("\n"); }int main(void) {LinkStack LS;InitStack(LS);Push(LS,11);Push(LS,22);Push(LS,33);Push(LS,44);Push(LS,55);PrintStack(LS);SElemType e ;GetTop(LS , e);printf("棧頂元素是: %d\n",e);Pop(LS,e);PrintStack(LS);Pop(LS,e);PrintStack(LS);return 0; }

?

總結(jié)

以上是生活随笔為你收集整理的链表实现栈的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。