.h

#define MAX_SIZE 1024typedef struct SEQSTACK {void *data[MAX_SIZE];int size; }SeqStack;class stack { public:stack();~stack();public:SeqStack* Stack;public://入棧void Push_Back (SeqStack* stack,void *data);//返回棧頂元素void *Top_SeqStack(SeqStack* stack);//出棧void Pop_Back(SeqStack* stack);//判斷是否為空bool IsEmpty(SeqStack* stack);//返回棧中的元素個數int Size_SeqStack(SeqStack* stack);//清空棧void Clear_SeqStack(SeqStack* stack);};

.cpp

stack::stack() {Stack = new SeqStack;for (size_t i = 0; i < MAX_SIZE; i++){Stack->data[i] = NULL;}Stack->size = 0;}stack::~stack() {if (Stack != NULL){return;}delete Stack;}//入棧 void stack::Push_Back(SeqStack* stack, void *data) {if ( stack==NULL || data==NULL || stack->size==MAX_SIZE){return;}stack->data[stack->size] = data;stack->size++; }//返回棧頂元素 void* stack::Top_SeqStack(SeqStack* stack) {if (stack == NULL || stack->size == 0){return NULL;}return stack->data[stack->size-1]; }//出棧 void stack::Pop_Back(SeqStack* stack) {if (stack == NULL || stack->size == 0){return ;}stack->data[stack->size - 1] = NULL;Stack->size--; }//判斷是否為空,空返回true否則者返回false bool stack::IsEmpty(SeqStack* stack) {if (stack == NULL || stack->size == 0){return true;}return false; }//返回棧中的元素個數 int stack::Size_SeqStack(SeqStack* stack) {return stack->size; }//清空棧 void stack::Clear_SeqStack(SeqStack* stack) {if (stack == NULL){return;}for (int i = 0; i < stack->size; i++){stack->data[i] = NULL;}stack->size = 0; }

main.cpp

typedef struct PERSON {char name[64];int age;}Person;int main() {stack* s = new stack();//創建數據Person p1 = { "p1",10 };Person p2 = { "p2",20 };Person p3 = { "p3",30 };Person p4 = { "p4",40 };Person p5 = { "p5",50 };//入棧s->Push_Back(s->Stack, &p1);s->Push_Back(s->Stack, &p2);s->Push_Back(s->Stack, &p3);s->Push_Back(s->Stack, &p4);s->Push_Back(s->Stack, &p5);//輸出while (s->Size_SeqStack(s->Stack) >0){//訪問棧頂元素Person* person = (Person*)s->Top_SeqStack(s->Stack);//輸出cout << "Name:"<< person->name<<" ";cout << "Age:" << person->age << " ";cout << endl;//彈棧s->Pop_Back(s->Stack);}return 0; }

學過匯編的都知道不多說了

總結

以上是生活随笔為你收集整理的栈_笔记的全部內容，希望文章能夠幫你解決所遇到的問題。

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