具体实现代码@数据结构探险——栈篇 3-2

file:MyStack.hpp
#ifndef MyStack_hpp
#define MyStack_hpp

#include <iostream>

using namespace std;

template <class T>
class MyStack{
public:
    MyStack(int size);
    ~MyStack();
    bool stackFull();
    bool stackEmpty();
    void clearStack();
    int stackLength();
    bool push(T elem);
    bool pop(T &elem);
    void stackTraverse(bool isFromBottom);
private:
    T *m_pBuffer;
    int m_iSize;
    int m_iTop;

};

template <class T>
MyStack<T>::MyStack(int size){
    m_iSize = size;
    m_pBuffer = new T[m_iSize];
    m_iTop = 0;
}

template <class T>
MyStack<T>::~MyStack(){
    delete []m_pBuffer;
    m_pBuffer = NULL;
}

template <class T>
bool MyStack<T>::stackFull(){
    return m_iTop==m_iSize?true:false;
}

template <class T>
bool MyStack<T>::stackEmpty(){
    return m_iTop==0?true:false;
}

template <class T>
void MyStack<T>::clearStack(){
    m_iTop = 0;
}

template <class T>
int MyStack<T>::stackLength(){
    return m_iTop;
}

template <class T>
bool MyStack<T>::push(T elem){
    if(stackFull()){
        return false;
    }
    else{
        m_pBuffer[m_iTop] = elem;
        m_iTop++;
        return true;
    }
}

template <class T>
bool MyStack<T>::pop(T &elem){
    if(stackEmpty()){
        return false;
    }
    else{
        m_iTop--;
        elem = m_pBuffer[m_iTop];
        return true;
    }

}

template <class T>
void MyStack<T>::stackTraverse(bool isFromBottom){
    if(isFromBottom){
        for(int i =0;i < m_iTop;i++) {
            cout << m_pBuffer[i] << endl;
        }
    }
    else{
        for(int i = m_iTop-1;i >=0;i--){
            cout << m_pBuffer[i] << endl;
        }
    }
}

#endif /* MyStack_hpp */

file:MyStack.cpp

file:Coordinate.hpp

#ifndef Coordinate_hpp
#define Coordinate_hpp

#include <ostream>
using namespace std;

class Coordinate{
public:
    friend ostream &operator<<(ostream &out,Coordinate &coor);

    Coordinate(int x = 0 ,int y = 0);
    void printCoordinate();

private:
    int m_iX;
    int m_iY;
};

#endif /* Coordinate_hpp */

file:Coordinate.cpp

#ifndef Coordinate_hpp
#define Coordinate_hpp

#include <ostream>
using namespace std;

class Coordinate{
public:
    friend ostream &operator<<(ostream &out,Coordinate &coor);

    Coordinate(int x = 0 ,int y = 0);
    void printCoordinate();

private:
    int m_iX;
    int m_iY;
};

#endif /* Coordinate_hpp */

file:demo.cpp

#include <iostream>
#include <string>
#include "MyStack.hpp"
#include "Coordinate.hpp"

using namespace std;

int main(void){
    MyStack<Coordinate> *pStack = new MyStack<Coordinate>(5);

    Coordinate coor1(1,2);
    Coordinate coor2(2,3);
    Coordinate coor3(3,4);
    Coordinate coor4(4,5);
    Coordinate coor5(5,6);

    pStack->push(coor1);
    pStack->push(coor2);
    pStack->push(coor3);
    pStack->push(coor4);
    pStack->push(coor5);

    pStack->stackTraverse(true);

    Coordinate elem(0,0);
    pStack->pop(elem);
    elem.printCoordinate();

    cout << pStack->stackLength() << endl;

    pStack->stackTraverse(true);

    pStack->clearStack();

    if(pStack->stackEmpty()){
        cout << "栈为空" << endl;
    }

    if(pStack->stackFull()){
        cout << "栈为满" << endl;
    }

    delete pStack;
    pStack = NULL;

}