链接栈
摘要:#include using namespace std; typedef int stackEntry; const int overflow = 1; const int underflow = 2; const int success = 0; struct Node { stackEntry data; Node *next; }; class stack { public:...
阅读全文
括号匹配--栈
摘要:#include <iostream>using namespace std;typedef char stackEntry;const int maxstack = 100;//栈的最大尺寸class stack{public: stack(); void pop(); void push(con
阅读全文
反转波兰计算器
摘要:#include <iostream>using namespace std;typedef double stackEntry; const int overflow = 1;const int underflow = 2;const int success = 0; const int maxs
阅读全文
栈的应用 乘坐校园通勤车
摘要:#include <iostream>using namespace std;typedef int stackEntry;const int maxstack = 100;//栈的最大尺寸class stack{public: stack(); void pop(); void push(cons
阅读全文
链表c++实现一
摘要:#include <iostream>using namespace std; typedef char nodeEntry; struct Node{ //数据成员 nodeEntry data; Node* next; //构建函数 Node(); Node(nodeEntry item,Nod
阅读全文