数据结构之栈

妖狐艹你老母 2022-05-27 05:39 197阅读 0赞

头文件：

using namespace std;
    
    template <class T>
    class MyStack {
    
    public:
        MyStack(int size);  //构造函数，传入栈容量
        ~MyStack();            //析构函数
        void clear();       //清除
        bool isFull();      //判断栈是否已满
        bool isEmpty();     //判断栈是否为空
        int length();       //获取栈长度
        bool push(T ele);   //入栈
        bool pop(T &ele);   //出栈
        void printAll();    //打印栈内容
    
    private:
        int m_iTop;
        T *m_pBuffer;
        int m_iSize;
    };
    
    template <class T> MyStack<T>::MyStack(int size) {
        m_iSize = size;
        m_pBuffer = new T[size];
    }
    
    template <class T> MyStack<T>::~MyStack() {
        delete []m_pBuffer;
    }
    
    template <class T> void MyStack<T>::clear() {
        m_iTop = 0;
    }
    
    template <class T> bool MyStack<T>::isFull() {
        return m_iTop >= m_iSize;
    }
    
    template <class T> bool MyStack<T>::isEmpty() {
        return m_iTop == 0;
    }
    
    template <class T> int MyStack<T>::length() {
        return m_iTop;
    }
    
    template <class T> bool MyStack<T>::push(T ele) {
    
        if (isFull()) return false;
    
        m_pBuffer[m_iTop] = ele;
        m_iTop++;
    
        return true;
    }
    
    template <class T> bool MyStack<T>::pop(T &ele) {
    
        if (isEmpty()) return false;
    
        m_iTop--;
        ele = m_pBuffer[m_iTop];
        return true;
    }
    
    template <class T> void MyStack<T>::printAll() {
    
        for (int i = 0; i < length(); i++) {
            cout << m_pBuffer[i] << endl;
        }
    }

测试：

#include <iostream>
    #include <stdlib.h>
    #include "MyStack.h"
    
    using namespace std;
    
    
    int main(void) {
    
        MyStack<int> stack(5);
        stack.push(1);
        stack.push(2);
        stack.push(3);
        stack.push(4);
        stack.push(5);
        stack.push(6);
    
        cout << "===printall===" << endl;
        stack.printAll();
        cout << "===printall===" << endl;
    
        int ele;
        stack.pop(ele);
        cout << "pop : " << ele << endl;
    
        cout << "===printall===" << endl;
        stack.printAll();
        cout << "===printall===" << endl;
    
        system("pause");
        return 0;
    
    }