基于链表的堆栈

//基于链表的堆栈

#include<iostream>

#include<stdexcept>

using namespace std;

class Queue{

public:

    Queue():m_front(NULL),m_rear(NULL){}

    ~Queue(){

    //节点回溯

    for(Node *next;m_rear;m_rear=next)

        {

        if(!m_rear)

            next=m_rear->m_next;

        delete m_rear;

        }

    }

    void push(int data){

    Node *node=new Node(data);

    if(m_rear)

        node->m_next=m_rear;//非第一个节点

    else

        m_front=node;

    m_rear=node;

    }

    int pop(){

    if(empty())

        throw UnderFlow();

    int temp=m_rear->m_data;

    Node *next=m_rear->m_next;

    delete m_rear;

    m_rear=next;

     

    return temp;

    }

    bool empty(){

    return !m_front&&!m_rear;

    }

private:

    class Node{

    public:

        Node(int data=0,Node *next=NULL):m_data(data),m_next(next){}

        int m_data;

        Node *m_next;

    };

    class UnderFlow{

        const char*what()const throw(){

        cout<<"堆栈下溢"<<endl;

        }

    };

    Node *m_rear;//后端

    Node *m_front;//前端

};

int main(){

try{

    Queue queue;

    for(int i=0;i<10;++i)

        queue.push(i);

        while(!queue.empty())

            cout<<queue.pop()<<endl;

        cout<<endl;

    }

    catch(exception &ex){

        cout<<ex.what()<<endl;

    }

 

return 0;

}