FlowQueue.hpp

#ifndef FLOWQUEUE_HPP
#define FLOWQUEUE_HPP
struct FlowNode {
    int time;  // 第几分钟 (1-30)
    int count; // 预测人数
    FlowNode* next;
    FlowNode(int t, int c) : time(t), count(c), next(nullptr) {}
};
class FlowQueue {
public:
    FlowNode *front, *rear;
    FlowQueue() : front(nullptr), rear(nullptr) {}

    // 入队
    void push(int t, int c) {
        FlowNode* node = new FlowNode(t, c);
        if (rear) rear->next = node;
        else front = node;
        rear = node;
    }

    // 查指定时间的人数
    int get_count(int t) {
        FlowNode* p = front;
        while (p) {
            if (p->time == t) return p->count;
            p = p->next;
        }
        return 0; // 没找到
    }
    
    // 清空
    void clear() {
        while (front) {
            FlowNode* t = front;
            front = front->next;
            delete t;
        }
        rear = nullptr;
    }
};
#endif