栈的实现（cpp）链表实现

栈的结构体

template <class T>
struct LinkNode
{
    T Data;
    LinkNode *Next;
    LinkNode() : Next(nullptr)
    {
        cout << "Please input data: ";
        cin >> Data;
    }
    LinkNode(const T &data, LinkNode *next = nullptr) : Data(data), Next(next) {}
    ~LinkNode() {}
};

栈的操作

template <class T>
class StackList
{
    // private:
    LinkNode<T> *Head;
    int Size;

public:
    StackList(int Len = 0);
    ~StackList() {}
    /**
     * push
     * pop
     * top
     * isempty
     * **/
    bool IsEmpty() //判断栈是否为空
    {
        return Size == 0;
    }
    void Push(const T &data);//向栈顶加入元素
    T Top() const;     //返回栈顶元素
    T Pop();           //返回栈顶元素并移除
    void PrintStack(); //打印stack内的所有值，调试使用
};

StackList.h

/*
 * @Description: StackList.h
 * @Author: gaumn 
 * @Date: 2021-02-22 18:30:12
 * @LastEditTime: 2021-02-22 22:17:29
 * @LastEditors: gaumn
 */
#pragma onece
#include <iostream>
using namespace std;

template <class T>
struct LinkNode
{
    T Data;
    LinkNode *Next;
    LinkNode() : Next(nullptr)
    {
        cout << "Please input data: ";
        cin >> Data;
    }
    LinkNode(const T &data, LinkNode *next = nullptr) : Data(data), Next(next) {}
    ~LinkNode() {}
};

template <class T>
class StackList
{
    // private:
    LinkNode<T> *Head;
    int Size;

public:
    StackList(int Len = 0);
    ~StackList() {}
    /**
     * push
     * pop
     * top
     * isempty
     * **/
    bool IsEmpty() //判断栈是否为空
    {
        return Size == 0;
    }
    void Push(const T &data);//向栈顶加入元素
    T Top() const;     //返回栈顶元素
    T Pop();           //返回栈顶元素并移除
    void PrintStack(); //打印stack内的所有值，调试使用
};
#include "StackList.cpp" //模板实现文件

StackList.cpp

/*
 * @Description: stack的List实现（StackList.cpp）
 * @Author: gaumn 
 * @Date: 2021-02-22 18:29:40
 * @LastEditTime: 2021-02-23 14:14:02
 * @LastEditors: gaumn
 */
template <class T>
StackList<T>::StackList(int len)
{
    // LinkNode<T>* Cur=this->Head;
    LinkNode<T> *Cur;
    for (int i = 0; i < len; i++)
    {
        Cur = new LinkNode<T>();
        if (i == 0)
        {
            this->Head = Cur;
        }
        else
        {
            Cur->Next = this->Head;
            this->Head = Cur;
        }
        Size++;
    }
}
template <class T>
void StackList<T>::Push(const T &data)
{
    LinkNode<T> *Cur = new LinkNode<T>(data);
    if (this->Head == nullptr)
        this->Head = Cur;
    else
    {
        LinkNode<T> *Temp = this->Head;
        Cur->Next = Temp;
        this->Head = Cur;
    }
    Size++;
}
template <class T>
T StackList<T>::Top() const
{
    LinkNode<T> *Cur = this->Head;
    if (Cur != nullptr)
        return Cur->Data;
    else
        return -1;
}
template <class T>
T StackList<T>::Pop()
{
    LinkNode<T> *Cur = this->Head;
    if (Cur == nullptr)
        return -1;
    T Top = Cur->Data;
    this->Head = Cur->Next;
    Size--;
    return Top;
}
template <class T>
void StackList<T>::PrintStack()
{
    LinkNode<T> *Cur = this->Head;
    if (Cur == nullptr)
    {
        cout << "当前栈为空";
    }
    int n = 0;
    while (Size - n > 0 && Cur != nullptr)
    {
        cout << "第" << n++ << "个元素为：" << Cur->Data << endl;
        Cur = Cur->Next;
    }
}

testStack.cpp

/*
 * @Description: stack的List实现（测试文件）
 * @Author: gaumn 
 * @Date: 2021-02-22 18:31:02
 * @LastEditTime: 2021-02-22 22:18:34
 * @LastEditors: gaumn
 */
#include "StackList.h"
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[])
{
    system("chcp 65001");
    StackList<int> stackInt(3);
    stackInt.Push(2);
    stackInt.PrintStack();
    cout << "弹出栈顶元素为:" << stackInt.Pop() << endl;
    cout << "栈顶元素为:" << stackInt.Top() << endl;
    cout << "弹出栈顶元素为:" << stackInt.Pop() << endl;
    stackInt.PrintStack();
    // cout << "hello";
    return 0;
}

测试结果