模板类实现stack

stack模板头文件

#ifndef STACK_H_INCLUDED
#define STACK_H_INCLUDED

template <class Type>
class Stack
{
private:
    enum {MAX = 100};
    Type items[MAX];
    int top;


public:
    Stack();
    bool isempty();
    bool isfull();
    bool push(const Type &item);
    bool pop(Type &item);
};


template <class Type>
Stack<Type>::Stack()
{
    top = 0;
}


template <class Type>
bool Stack<Type>::isempty()
{
    return top == 0;
}


template <class Type>
bool Stack<Type>::isfull()
{
    return top == MAX;
}


template <class Type>
bool Stack<Type>::push(const Type &item)
{
    if (top < MAX)
    {
        items[top++] = item;
        return true;
    }
    else
        return false;
}


template <class Type>
bool Stack<Type>::pop(Type &item)
{
    if(top > 0)
    {
        item = items[--top];
        return true;
    }
    else
        return false;
}

#endif // STACK_H_INCLUDED


stack对象测试文件

#include <iostream>
#include <string>
#include <cctype>
#include "stack.h"
using namespace std;


int main()
{


    Stack<string> st;
    char ch;
    string po;
    cout << "Please enter A  to add a purchase order,\n"
         << "P to process a PO, or O to quit!!\n";


         while (cin >> ch && toupper(ch) != 'Q')
         {
             while(cin.get() != '\n')
             {
                 continue;
             }


             if (!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 alredy full!!\n";
                  else
                    st.push(po);
                  break;


         case 'P':
         case 'p':if (st.isempty())
                cout << "stack alreay 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;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值