本文共 1876 字，大约阅读时间需要 6 分钟。
跟函数模板差不多 我直接上代码吧
stacktp.h
#ifndef STACKTP_H_#define STACKTP_H_template class Stack{ private: enum {MAX = 10}; Type items[MAX]; int top; public: Stack(); bool isempty(); bool isfull(); bool push(const Type & item); bool pop(Type & item);};template Stack ::Stack(){ top = 0;}template bool Stack ::isempty(){ return top == 0;}template bool Stack ::isfull(){ return top == MAX;}template bool Stack ::push(const Type & item){ if (top < MAX) { items[top++] = item; return true; } else { return false; }}template bool Stack ::pop(Type & item){ if (top > 0) { item = items[--top]; return true; } else return false;}#endif
stacktem.cpp
#include #include #include #include "stacktp.h"using std::cin;using std::cout;int main(){ Stack st; char ch; std::string po; cout << "Please enter A to add a purchase order,\n" << "P to process a PO, or Q to quit.\n"; while(cin >> ch && std::toupper(ch) != 'Q') { while (cin.get() != '\n') continue; if (!std::isalpha(ch)) { cout << 'a'; continue; } switch(ch) { case 'A': case 'a': cout << "Enter a PO number to add: "; cin >> po; if(st.isfull()) cout << "stack already full\n"; else st.push(po); break; case 'p': case 'P': if (st.isempty()) cout << "stack already empty\n"; else { st.pop(po); cout << "PO #" << po << " popped\n"; break; } } cout << "Please enter A to add a purchase order,\n" << "P to process a PO, or Q to quit.\n"; } cout << "Bye\n"; return 0;}
这不适用于指针
关于指针栈明天说
转载地址：http://enepi.baihongyu.com/