数据结构－队列

First in First Out

宏断言assert：

在头文件<cassert>中定义，里面为判断语句，为假则直接结束这个函数。

在判断队列是否为空时用到过：

assert(head <= tail);

简单队列的实现。

#include <iostream>
#include <cassert>
using namespace std;
class Queue {
private:
    int *data;
    int head, tail, length;
public:
    Queue(int length_input) {
        data = new int[length_input];
        length = length_input;
        head = 0;
        tail = -1;
    }
    ~Queue() {
        delete[] data;
    }
    void push(int element) {
        if (tail + 1 < length) {
            tail++;
            data[tail] = element;
        }
    }
    void output() {
        for (int i = head; i <= tail; i++) {
            cout << data[i] << " ";
        }
        cout << endl;
    }
    int front(){
        assert(head <= tail);
        return data[head];
    }
    void pop(){
        assert(head <= tail);
        head+=1;
    }
};
int main() {
    Queue queue(100);
    for (int i = 1; i <= 10; i++) {
        queue.push(i);
    }
    queue.output();
    cout<<queue.front()<<endl;
    queue.pop();
    queue.output();
    return 0;
}

循环队列的使用

#include <iostream>
#include <cassert>
using namespace std;
class Queue {
private:
    int *data;
    int head, tail, length, count;
public:
    Queue(int length_input) {
        data = new int[length_input];
        length = length_input;
        head = 0;
        tail = -1;
        count = 0;
    }
    ~Queue() {
        delete[] data;
    }
    bool push(int element) {
        if (count < length) {
            tail = (tail + 1) % length;
            data[tail] = element;
            count++;
            return true;
        } else {
            return false;
        }
    }
    void output() {
        for (int i = head; i != tail + 1; i = (i + 1) % length) {
            cout << data[i] << " ";
        }
        cout << endl;
    }
    int front() {
        assert(count>0);
        return data[head];
    }
    void pop() {
        assert(count>0);
        head=(head+1)%length;
        count-=1;
    }
};
int main() {
    Queue queue(100); 
    for (int i = 1; i <= 10; i++) {
        queue.push(i);
    }
    queue.output();
    cout << queue.front() << endl;
    queue.pop();    
    queue.output();
    return 0;
}