![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
栈
loulyx
这个作者很懒,什么都没留下…
展开
-
数据结构之链栈 C++实现
#include <iostream>typedef int ElemType_LinkStack;class SNode {public: ElemType_LinkStack data; SNode* next; SNode() :data(0), next(nullptr) {} SNode(ElemType_LinkStack _data) :data(_data), next(nullptr) {}};//带头结点的链栈class LinkStack {pu.原创 2021-05-03 15:49:30 · 113 阅读 · 0 评论 -
数据结构之顺序栈 C++实现
#include <iostream>typedef int ElemType_Stack;class Stack {public: ElemType_Stack* data; int maxSize; int top; //默认构造函数 Stack() :data(nullptr), maxSize(0), top(0){} //构造函数 Stack(int _maxSize) :maxSize(_maxSize), top(0) { data = new Elem.原创 2021-05-01 21:42:49 · 71 阅读 · 0 评论