数据结构学习笔记6——顺序栈(stack)源码与测试代码

港控/mmm° 2022-09-08 00:05 141阅读 0赞

# 1.SeriationStack.h  #

#ifndef SERIATIONSTACK_H 
    #define SERIATIONSTACK_H
    
    #define MAX_STACK_SIZE 100
    
    template <typename T>
    class SeriationStack
    {
    public:
        SeriationStack();
        ~SeriationStack();
    
        //初始化
        bool Init();
    
        //入栈
        bool Push(T node);
    
        //出栈
        T Pop();
    
        //获取元素个数
        int Size();
    
        //返回栈顶元素，不移动栈顶指针
        T Top();
    
        void Print();
    
    private:
        T *m_pBase;
        T *m_pTop;
        int m_iStacksize;
    };
    
    
    
    #endif

# 2.SeriationStack.cpp #

#include "stdafx.h"
    #include "SeriationStack.h"
    #include <iostream>
    using namespace std;
    
    template class SeriationStack<int>;
    
    template <typename T>
    SeriationStack<T>::SeriationStack()
    {
        Init();
    }
    
    template <typename T>
    SeriationStack<T>::~SeriationStack()
    {
        delete []m_pBase;
    }
    
    template <typename T>
    bool SeriationStack<T>::Init()
    {
        m_pBase = new T[MAX_STACK_SIZE];
        if (m_pBase)
        {
            m_pTop = m_pBase;
            m_iStacksize = MAX_STACK_SIZE;
            return true;
        } 
        else
        {
            m_pBase = nullptr;
            m_pTop = nullptr;
            m_iStacksize = 0;
            return false;
        }
    }
    
    template <typename T>
    bool SeriationStack<T>::Push(T node)
    {
        if (m_iStacksize == (m_pTop-m_pBase))
        {
            return false;//栈满
        }
    
        *m_pTop++ = node;
        return true;
    }
    
    template <typename T>
    T SeriationStack<T>::Pop()
    {
        if (m_pBase == m_pTop)
        {
            return T();//栈空
        }
    
        T node = *--m_pTop;
        return node;
    }
    
    template <typename T>
    int SeriationStack<T>::Size()
    {
        return m_pTop - m_pBase;
    }
    
    template <typename T>
    T SeriationStack<T>::Top()
    {
        return *(m_pTop - 1);
    }
    
    
    template <typename T>
    void SeriationStack<T>::Print()
    {
        int iSize = Size();
        int iCnt = 1;
        while (iCnt <= iSize)
        {
            cout << *(m_pTop - iCnt++) << endl;
        }
    
        cout << endl;
    }

# 3.main.cpp #

// MyStack.cpp : 定义控制台应用程序的入口点。
    //
    
    #include "stdafx.h"
    #include "SeriationStack.h"
    #include <iostream>
    using namespace std;
    
    int main()
    {
        SeriationStack<int> myStack;
        while (true)
        {
            cout << "\n请输入操作类型:\n\n1.入栈\n\n2.出栈\n\n3.获取栈大小\n\n4.获取栈顶元素\n\n5.打印所有元素\n\n";
            int i = 0;
            cin >> i;
            switch (i)
            {
            case 1://入栈
            {
                cout << "\n请输入要入栈的数值:\n";
                int m;
                cin >> m;
                myStack.Push(m);
                cout << "--------------------------------------------------\n";
            }break;
            case 2://出栈
            {            
                myStack.Pop();
                cout << "\n1个元素已出栈!\n";
                cout << "--------------------------------------------------\n";
            }break;
            case 3://获取栈大小
            {
                cout << "\n栈大小为:\n"<<myStack.Size()<<endl;
                cout << "--------------------------------------------------\n";
            }break;
            case 4://获取栈顶元素
            {
                cout << "\n栈顶元素为:\n"<<myStack.Top() << endl;
                cout << "--------------------------------------------------\n";
            }break;
            case 5://打印所有元素
            {
                cout << "所有元素如下:\n";
                myStack.Print();
                cout << "--------------------------------------------------\n";
            }break;
            default:
            {
                cout << "\n输入值不符合要求!\n";
                cout << "--------------------------------------------------\n";
            }
            break;
            }
        }
    
        return 0;
    }

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2pvbGluNjc4_size_16_color_FFFFFF_t_70][]

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2pvbGluNjc4_size_16_color_FFFFFF_t_70]: /images/20220829/0aff2ae6323643a08502efd5ea0e7c51.png