C++ 栈 （数组实现）

上一篇用链表实现了stack，这篇我们采用数组来存储数据，数组更容易理解，直接贴代码

第一、代码实现

#pragma once
#include <iostream>
using namespace std;
template <typename T> class StackArray {
public:
    StackArray(int size) {
        this->top = -1;
        this->maxSize = size;
        elements = new T[size];
    }
    ~StackArray() {
        delete [] elements;
    }
    bool push(T t);
    T pop();
    bool isEmpty();
    void print();

private:
    int top = -1;
    int maxSize;
    T* elements;

};

template<typename T>
bool StackArray<T>::push(T data) {
    if (top==maxSize)
    {
        return false;
    }
    elements[++top] = data;
    return true;
}

template<typename T>
T StackArray<T>::pop() {
    if (top==-1)
    {
        exit(-1);
    }
    return elements[top--];
}

template<typename T>
bool StackArray<T>::isEmpty() {
    return top == -1;
}

template<typename T>
void StackArray<T>::print() {
    int loop = top;
    while (loop>=0)
    {
        cout << elements[loop] << endl;
        loop--;
    }
}

第二、测试运行

#include "pch.h"
#include "StackArray.h"
#include <iostream>
using namespace std;

int main()
{
    StackArray<int> stack(10);
    stack.push(1);
    stack.push(3);
    stack.push(10);
    stack.push(40);
    stack.pop();
    stack.push(30);

    stack.print();

    std::cout << "Hello World!
"; 
}