摘要：
//堆栈,链表实现#includeusing namespace std;class stack{public: int data; stack*next; };stack*Linkstack(){ stack*s = new stack; s->next = NULL; //生成... 阅读全文
摘要：
//堆栈，数组实现#includeusing namespace std;#define Maxsize 100class stack{public: int data[Maxsize]; int top = -1; //保存栈顶下标值};int pop(stack*ptrl);... 阅读全文