Code highlighting produced by Actipro CodeHighlighter (freeware)

http://www.CodeHighlighter.com/



~queue()

{

queue  *p;

while(front!=rear)

{

p=front->rlink;

delete front; //这里会对front调用~queue()，然后递归下去

front=p;

}

delete front; //这里会对front调用~queue(),然后递归下去

} 

Code highlighting produced by Actipro CodeHighlighter (freeware)

http://www.CodeHighlighter.com/





//你用一个队列来模拟停车场本身是不合理的

//无法完成按车牌号的取出,所以下面的程序只能存车



#include <iostream> 

using namespace std; 

//建立停车场类 

class ParkingLot 

{ 

private: 

    int num; 

    int max_size; 

    int base; 

    int top; 

    int cnt;

    int *car; 



public: 

    ParkingLot(){} 

    //建立一个最大容量为n的停车场栈 

    ParkingLot(int n) 

    { 

        max_size=n; 

        car=new int[max_size]; 

        base=0; 

        top=0; 

        cnt=0;

    } 

    //空则返回1，否则返回0 

    int PL_empty() 

    { 

        return cnt == 0;

    } 

    //满则返回1，否则返回0 

    int PL_full()

    { 

        return cnt == max_size;

    } 

    //返回当前停车场内车辆数 

    int PL_length() 

    { 

        return cnt; 

    } 

    //取出第一辆车，将车牌号给e 

    int PopTop(int &e) 

    { 

        if(PL_empty()) 

        {

            cout <<"停车场中无该车\n"; 

        }

        else 

        { 

            top = (top - 1   max_size) % max_size;

            e=car[top];

            --cnt;

        } 

        return e; 

    } 

    //当停车场不满时，存入新车 

    void Push(int e) 

    { 

        if(PL_full()) 

        {

            cout <<"停车场已满请排队等候\n"; 

        }

        else 

        {

            car[top]=e; 

            top = (top 1)%max_size;

              cnt;

        } 

    } 

}; 

//建立车队类 

class queue 

{ 

private: 

    int element; 

    queue *front; 

    queue *rear; 

    queue *rlink; 

public: 

    //构造函数新建一个空的队列 

    queue(){} 

    queue(int n)//此处参数n只是为了区分两个构造函数 

    { 

        front=new queue; 

        //front=first; 

        rear=front; 

        rear->rear = front;

        //cout <<"构造成功\n"; 

    } 

    //析构函数销毁一个队列 

    ~queue() 

    { 

        queue  *p=front; 

        while(p!=rear) 

        { 

            queue* t = p;

            p = p->rlink;

            delete t; 

        } 

        delete p; //不明白！ 为什么加上这一部会出错误 

    } 

    //清空队列 

    int clearQueue() 

    { 

        queue  *p=front; 

        while(p!=rear) 

        { 

            queue* t = p;

            p = p->rlink;

            delete t; 

        } 

        front = rear;

        rear->rear = front;

        return 1; 

    } 

    //若队列为空返回1，否则返回0 

    int QueueEmpty() 

    { 

        return front==rear;

    } 

    //返回队列的长度 

    int QueueLength() 

    { 

        int i=0; 

        queue *p=front; 

        while(rear!=p) 

        { 

            i  ; 

            p=p->rlink; 

        } 

        return i; 

    } 

    //用e返回队列顶元素 

    void GetHead(int &e) 

    { 

        if(front!=rear) 

        {

            e = front->rlink->element;

        }

        else  

        {

            cout <<"队列为空\n"; 

        }

    } 

    //插入新的元素e为队列头元素 

    void EnQueue(int e) 

    { 

        queue *p=new queue; 

        p->element=e; 

        p->rlink = rear->rlink;

        rear->rlink=p; 

        rear=p; 

    } 

    //若队列不为空删除队列头元素用e返回 

    void DeQueue(int &e) 

    { 

        if(front!=rear) 

        {

            queue* t = front;

            front = t->rlink;

            e=t->rlink->element; 

            delete t;

            rear->rlink = front;

        }

        else  

        {

            cout <<"队列为空\n"; 

        }

    } 

    

}; 

//存车的函数 

void cunche(ParkingLot &a,queue &b) 

{ 

    int num; 

    cout <<"登记车牌请您输入："; 

    cin>>num; 

    if(!a.PL_full()) 

    { 

        a.Push(num); 

        cout <<"车牌号为" <<num <<"的车成功存入停车场\n"; 

    } 

    else 

    { 

        b.EnQueue(num); 

        cout <<"停车场已满，车牌号为" <<num <<"的车进入队列排队等候中,排在第"

            <<b.QueueLength() <<"位\n"; 

        

    } 

} 

//取车的函数 

void quche(ParkingLot &a,queue &b,ParkingLot &c) 

{ 

    int num; 

    int e; 

    if(a.PL_empty()) 

        cout <<"停车场为空\n"; 

    

    else 

    { 

        cout <<"请输入您要取的车的牌号："; 

        cin>>num; 

        a.PopTop(e); 

        while(e!=num) 

        { 

            c.Push(e); 

            if(a.PL_empty()) 

            { 

                cout <<"停车场内无该车，请重新选择输入\n"; 

                break; 

            } 

            a.PopTop(e); 

        } 

        if(e==num) 

            cout <<"车牌号为" <<num <<"的车成功从停车场取出\n"; 

        while(!c.PL_empty()) 

        { 

            c.PopTop(e); 

            a.Push(e); 

        } 

        if(!b.QueueEmpty()&&!a.PL_full()) 

        { 

            b.DeQueue(e); 

            a.Push(e); 

            cout <<"车牌号为" <<e <<"的车成功存入停车场\n"; 

        } 

        if(b.QueueEmpty()) 

            cout <<"无车排队等候\n"; 

    } 

} 





void main() 

{ 

    int n; 

    cout <<"输入停车场的最大容车辆数：\n"; 

    cin>>n; 

    ParkingLot A(n); 

    ParkingLot C(n);//暂时存放退出的车 

    queue B(1); 

    int choice; 

l1: 

    cout <<"欢迎光临，存车按1，取车按2,结束程序3："; 

    cin>>choice; 

    switch(choice) 

    { 

    case 1:cunche(A,B);break; 

    case 2:quche(A,B,C);break; 

    case 3:exit(0); 

    default:cout <<"输入有误\n"; 

    } 

    goto l1; 

    

    

}