只允許容器往一個方向進出，先進后出為棧容器

.h

//鏈式棧的節(jié)點 typedef struct LINKNODE {struct LINKNODE*next; }LinkNode;//鏈式棧 typedef struct LINKSTACK {LinkNode head;int size;}LinkStack;class linkstack { public:linkstack();~linkstack(); public:LinkStack* Stack;public://入棧void push_back(LinkStack* stack,LinkNode* data);//出棧void pop_back(LinkStack* stack);//返回棧頂元素LinkNode* Top_LinkStack(LinkStack* stack);//返回棧元素的個數int Size_LinkStack(LinkStack* stack);//清空棧void Clear_LinkStack(LinkStack* stack);};

.cpp

linkstack::linkstack() {Stack = new LinkStack;Stack->head.next = NULL;Stack->size = 0; }linkstack::~linkstack() {if (Stack == NULL){return;}delete Stack;}//入棧 void linkstack::push_back(LinkStack* stack, LinkNode* data) {if (stack == NULL || data == NULL){return;}data->next = stack->head.next;stack->head.next = data;stack->size++; }//出棧 void linkstack::pop_back(LinkStack* stack) {if (stack == NULL || stack->size == 0){return;}LinkNode* pNext = stack->head.next;stack->head.next = pNext->next;stack->size--; }//返回棧頂元素 LinkNode* linkstack::Top_LinkStack(LinkStack* stack) {if (stack == NULL || stack->size == 0){return NULL;}return stack->head.next; }//返回棧元素的個數 int linkstack::Size_LinkStack(LinkStack* stack) {if (stack == NULL ){return -1;}return stack->size; }//清空棧 void linkstack::Clear_LinkStack(LinkStack* stack) {if (stack == NULL || stack->size == 0){return;}stack->head.next = NULL;stack->size = 0; }

main.cpp

typedef struct PERSON {LinkNode node;char name[64];int age; }Person;int main() {linkstack* l = new linkstack();//創(chuàng)建數據Person p1, p2, p3, p4, p5;strcpy(p1.name, "p1");strcpy(p2.name, "p2");strcpy(p3.name, "p3");strcpy(p4.name, "p4");strcpy(p5.name, "p5");p1.age = 10;p2.age = 20;p3.age = 30;p4.age = 40;p5.age = 50;//入棧l->push_back(l->Stack, (LinkNode*)&p1);l->push_back(l->Stack, (LinkNode*)&p2);l->push_back(l->Stack, (LinkNode*)&p3);l->push_back(l->Stack, (LinkNode*)&p4);l->push_back(l->Stack, (LinkNode*)&p5);//輸出while (l->Size_LinkStack(l->Stack) >0){//取出棧頂元素Person* p = (Person*)l->Top_LinkStack(l->Stack);cout << "Name:" << p->name << " ";cout << "Age:" << p->name << " ";cout << endl;//彈出棧頂元素l->pop_back(l->Stack);}delete l;return 0; }

總結

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

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