顺序栈

摘要：本文主要介绍了顺序栈的实现和具体的应用。

SqStack.h

#pragma once
#ifndef _SQSTACK_
#define _SQSTACK_

template<class ElemType>
class SqStack
{
protected:
    int count;
    int maxSize;
    ElemType *elems;
public:
    SqStack(int size);
    virtual~SqStack();
    int Lence();
    bool Empty();
    void Clear();
    bool Push(const ElemType &e); //在栈顶添加元素
    void Traverse(void(*visit)(const ElemType&));  //遍历栈中的元素
    bool Top(ElemType &e);  //用e返回栈顶元素
    bool Pop(ElemType &e);   //删除栈顶元素
    SqStack(const SqStack<ElemType> &copy);  //复制构造函数
    SqStack<ElemType>& operator=(const SqStack<ElemType>&copy);  //重载赋值运算符
};


#endif // !_SQSTACK_

SqStack.cpp

#include "SqStack.h"


template<class ElemType>
SqStack<ElemType>::SqStack(int size){
    count = 0;
    maxSize = size;
    elems = new ElemType[maxSize];
}

template<class ElemType>
SqStack<ElemType>::~SqStack()
{
    delete[] elems;
}

template<class ElemType>
int SqStack<ElemType>::Lence() {
    return count;
}

template<class ElemType>
bool SqStack<ElemType>::Empty() {
    return count == 0;
}

template<class ElemType>
void SqStack<ElemType>::Clear() {
    count = 0;
}

template<class ElemType>
bool SqStack<ElemType>::Push(const ElemType &e) {
    if (count==maxSize) {
        return false;
    }
    else {
        elems[count++] = e;
        return true;
    }
}

template<class ElemType>
void SqStack<ElemType>::Traverse(void(*visit)(const ElemType&)) {
    for (int pos = 1; pos<=Lence(); pos++)
    {
        (*visit)(elems[pos-1]);
    }
}

template<class ElemType>
bool SqStack<ElemType>::Top(ElemType &e){
    if (Empty()) {
        return false;
    }
    else {
        e = elems[count-1];
        return true;
    }
}

template<class ElemType>
bool SqStack<ElemType>::Pop(ElemType &e) {
    if (Empty()) {
        return false;
    }
    else {
        e = elems[count-1];
        count--;
        return true;
    }
}

template<class ElemType>
SqStack<ElemType>::SqStack(const SqStack<ElemType> &copy) {
    maxSize = copy.maxSize;
    elems = new ElemType[maxSize];
    count = copy.count;
    for (int pos=1;pos<=Lence();pos++)
    {
        elems[pos - 1] = copy.elems[pos-1];
    }
}

template<class ElemType>
SqStack<ElemType>& SqStack<ElemType>::operator=(const SqStack<ElemType>&copy) {
    if (&copy!=this) {
        maxSize = copy.maxSize;
        delete[] elems;
        elems = new ElemType[maxSize];
        count = copy.count;

        for (int pos = 1; pos <= Lence(); pos++)
        {
            elems[pos - 1] = copy.elems[pos - 1];
        }
    }
}

main.cpp

#include<iostream>
#include "SqStack.cpp"

using namespace std;

void show(const int &e) {
    cout << e << endl;
}

void test() {
    SqStack<int> s(5);
    s.Push(10);
    s.Push(20);
    s.Push(30);
    void(*pt)(const int &);
    pt = show;
    s.Traverse(pt);
    int a;
    s.Pop(a);
    cout << a << endl;  //返回30
    s.Top(a);
    cout << a << endl;  //返回20
    SqStack<int> s1(s);
    s1.Traverse(pt);  //返回10,20
    SqStack<int> s2 = s;
    s2.Traverse(pt);  //返回10,20
}

int main() {
    test();
    system("pause");
    return 0;
}