順序棧介紹

順序棧就是用順序存儲結構構成的后進先出這樣結構的棧。一般我們用數組來進行模擬。為了讓后順序棧更通用呢，我們還是在數據類型上使用void*，我們只負責維護用戶提供的數據的地址就行了，不負責用戶數據的維護。對外提供的SeqStack 類型 是void*類型，可以用來隱藏我們棧內具體實現細節。

順序棧代碼

SeqStack.h頭文件

#pragma once #ifndef __SEQSTACK_H__ #define __SEQSTACK_H__ #define MAXSIZE 1024 typedef enum { FALSE, TRUE } Boolean; typedef struct SStack {void* data[MAXSIZE];int size; }SStack; typedef void* SeqStack;//初始化 SeqStack Init_SeqStack(); //壓棧 void Push_SeqStack(SeqStack stack, void* data); //彈棧 void* Pop_SeqStack(SeqStack stack); //獲取棧頂 void* Top_SeqStack(SeqStack stack); //是否為空棧 //1 是空，0 非空 int IsEmpty_SeqStack(SeqStack stack); //棧元素個數 int Size_SeqStack(SeqStack stack); //銷毀 棧 void Destroy_SeqStack(SeqStack stack);#endif // !__SEQSTACK_H__

SeqStack.c實現文件

#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <stdlib.h> #include <string.h> #include "SeqStack.h"//初始化 SeqStack Init_SeqStack() {SStack* stack = (SStack*)malloc(sizeof(SStack));stack->size = 0;memset(stack->data, 0, MAXSIZE);return stack; } //壓棧 void Push_SeqStack(SeqStack stack, void* data) {if (NULL == stack || NULL == data){return;}SStack* myStack = (SStack*)stack;myStack->data[myStack->size] = data;myStack->size++; } //彈棧 void* Pop_SeqStack(SeqStack stack) {SStack* myStack = (SStack*)stack;if (NULL == stack || 0 == myStack->size){return NULL;}void* data = myStack->data[myStack->size - 1];myStack->size--;return data; } //獲取棧頂 void* Top_SeqStack(SeqStack stack) {SStack* myStack = (SStack*)stack;if (NULL == stack || 0 == myStack->size){return NULL;}void* data = myStack->data[myStack->size - 1];return data; } //是否為空棧 //1 是空，0 非空 int IsEmpty_SeqStack(SeqStack stack) {SStack* myStack = (SStack*)stack;if (NULL == stack || myStack->size == 0){return 1;}return 0; } //棧元素個數 int Size_SeqStack(SeqStack stack) {SStack* myStack = (SStack*)stack;if (NULL == stack){return 0;}return myStack->size; } //銷毀 棧 void Destroy_SeqStack(SeqStack stack) {SStack* myStack = (SStack*)stack;if (myStack != NULL){free(myStack);} }

Main.c測試文件

#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <stdlib.h> #include "SeqStack.h" //測試 數據 typedef struct Person {char name[64];int age; }Person;int main(int argc, char *argv[]) {Person p1 = { "Lily",11 };Person p2 = { "Laymond",21 };Person p3 = { "John",31 };Person p4 = { "Leo",41 };Person p5 = { "Zeo",51 };SeqStack stack = Init_SeqStack();Push_SeqStack(stack, &p1);Push_SeqStack(stack, &p2);Push_SeqStack(stack, &p3);Push_SeqStack(stack, &p4);Push_SeqStack(stack, &p5);printf("棧頂元素:name=%s,age=%d\n", ((Person*)Top_SeqStack(stack))->name , ((Person*)Top_SeqStack(stack))->age);printf("棧的元素個數:%d\n", Size_SeqStack(stack));Person* p = NULL;while (!IsEmpty_SeqStack(stack)){p = Pop_SeqStack(stack);printf("name=%s,age=%d\n", p->name, p->age);}printf("棧的元素個數:%d\n", Size_SeqStack(stack));Destroy_SeqStack(stack);return 0; }

代碼運行檢測

總結

以上是生活随笔為你收集整理的线性表：顺序栈算法实现的全部內容，希望文章能夠幫你解決所遇到的問題。

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