線性棧

1.判空條件：S.top==-1;
2.滿棧條件：S.top=maxn-1

#include<cstdio> #include<stdlib.h>#define maxn 1000typedef struct node {int date[maxn];int top;//類似于棧頂指針 }seqstack;void stack_init(seqstack *S)//棧的初始化 {S->top = -1; }int stack_empty(seqstack S)//判斷棧是否為空棧 {if (S.top == -1)return 0;elsereturn 1; }void Push(seqstack* S, int value)//入棧 {if (S->top == maxn - 1){printf_s("棧已滿！\n");exit(0);}else{S->top++;S->date[S->top] = value;} }int Pop(seqstack* S)//出棧操作 {if (S->top == -1){printf_s("空棧！\n");return 0;}else{int x = S->date[S->top];S->top--;return x;} }int stack_gettop(seqstack* S)//取棧頂元素 {if (S->top == -1){printf_s("空棧！\n");return 0;}else{int x = S->date[S->top];return x;} }void stack_clear(seqstack* S)//清空棧 {S->top = -1; }int stack_length(seqstack* S)//求棧長 {return S->top; }void stack_show(seqstack* S)//顯示棧中所有元素 {if (S->top == -1){printf_s("空棧！\n");exit(0);}else{int key = S->top;while (S->top!=-1){printf_s("%d\n", stack_gettop(S));}} }int main() {seqstack* S;S = (seqstack*)malloc(sizeof(seqstack));stack_init(S);int n;scanf_s("%d", &n);for (int i = 0; i < n; i++){int value;scanf_s("%d", &value);Push(S, value);}stack_show(S);return 0; }

鏈式棧

1.判空條件：S.top==NULL;

#include<stdio.h> #include<stdlib.h> //可以使用 malloc ,用<malloc.h>也可以 #define len sizeof(LStackNode) typedef struct node {struct node* next;int data; }LStackNode;typedef struct {struct node* top;//棧頂指針，只會指向棧頂元素 }Linke_stack;Linke_stack* S; void stack_init(Linke_stack* S)//棧的初始化 {S->top =NULL;//指向空 }int stack_empty(Linke_stack S)//判斷棧是否為空棧，空為真 {if (S.top == NULL)return 1;elsereturn 0; }void Push(Linke_stack* S, int value)//入棧 {LStackNode* node;node = (LStackNode*)malloc(len);if (node == NULL){printf_s("申請空間失敗!\n");exit(0);}else{node->data = value;node->next = S->top;S->top = node;} }int Pop(Linke_stack* S)//出棧操作 {if ( S->top==NULL){printf_s("空棧！\n");return 0;}else{int value = S->top->data;LStackNode* node;node = S->top;S->top = node->next;//指針下移棧頂free(node); //記得釋放內存return value;//返回棧頂元素} }int stack_gettop(Linke_stack* S)//取棧頂元素 {if (S->top == NULL){printf_s("空棧！\n");return 0;}else{int x = S->top->data;return x;} }void stack_clear(Linke_stack* S)//清空棧 {S->top = NULL; }int stack_length(Linke_stack S)//求棧長 {int count = 0;while (S.top != NULL){count++;S.top = S.top->next;}return count; }//顯示棧中所有元素, void stack_show(Linke_stack S)//注意形參只能用單向傳遞，不能地址轉遞（即Linke_stack *S {//Linke_stack* s = S;if (S.top == NULL){printf_s("空棧！\n");exit(0);}else{while (S.top != NULL){printf_s("%d\n", S.top->data);S.top= S.top->next;}//S->top = s->top;} }int main() {Linke_stack* S;S = (Linke_stack*)malloc(len);stack_init(S);int n;scanf_s("%d", &n);for (int i = 0; i < n; i++){int value;scanf_s("%d", &value);Push(S, value);}stack_show(*S);int m;printf_s("請輸入要入棧的元素:");scanf_s("%d", &m);Push(S,m);stack_show(*S);Pop(S);stack_show(*S);return 0; }

總結

以上是生活随笔為你收集整理的c语言数据结构篇之栈（线性栈与链式栈）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。