5.看病排队候诊问题

#include <stdio.h>
#include <stdlib.h>

// 定义病人结构体
typedef struct {
    int id;          // 病人编号
    int priority;    // 病人优先级
} Patient;

// 定义队列结构体
typedef struct {
    Patient* data;   // 存储病人的数组
    int front;       // 队列头部索引
    int rear;        // 队列尾部索引
    int maxSize;     // 队列最大容量
} Queue;

// 初始化队列
void initQueue(Queue* queue, int maxSize) {
    queue->data = (Patient*)malloc(maxSize * sizeof(Patient));
    queue->front = -1;
    queue->rear = -1;
    queue->maxSize = maxSize;
}

// 判断队列是否为空
int isEmpty(Queue* queue) {
    return queue->front == -1;
}

// 判断队列是否已满
int isFull(Queue* queue) {
    return (queue->rear + 1) % queue->maxSize == queue->front;
}

// 入队操作
void enqueue(Queue* queue, Patient patient) {
    if (isFull(queue)) {
        printf("队列已满，无法插入新病人。\n");
        return;
    }

    if (isEmpty(queue)) {
        queue->front = 0;
    }

    queue->rear = (queue->rear + 1) % queue->maxSize;
    queue->data[queue->rear] = patient;
}

// 出队操作
Patient dequeue(Queue* queue) {
    if (isEmpty(queue)) {
        printf("队列为空，无法删除病人。\n");
        Patient emptyPatient = { -1, -1 };
        return emptyPatient;
    }

    Patient patient = queue->data[queue->front];

    if (queue->front == queue->rear) {
        // 队列中只有一个元素
        queue->front = -1;
        queue->rear = -1;
    } else {
        queue->front = (queue->front + 1) % queue->maxSize;
    }

    return patient;
}

// 获取队头病人
Patient getFront(Queue* queue) {
    if (isEmpty(queue)) {
        printf("队列为空，无法获取队头病人。\n");
        Patient emptyPatient = { -1, -1 };
        return emptyPatient;
    }

    return queue->data[queue->front];
}

int main() {
    int numPatients;
    printf("请输入病人数量：");
    scanf("%d", &numPatients);

    Queue queue;
    initQueue(&queue, numPatients);

    // 输入病人信息并入队
    for (int i = 0; i < numPatients; i++) {
        Patient patient;
        printf("请输入病人编号和优先级（用空格分隔）：");
        scanf("%d %d", &patient.id, &patient.priority);
        enqueue(&queue, patient);
    }

    printf("开始诊治病人...\n");

    // 诊治病人，按照优先级和先来先服务的原则
    while (!isEmpty(&queue)) {
        Patient patient = dequeue(&queue);
        printf("诊治病人：%d（优先级：%d）\n", patient.id, patient.priority);
    }

    printf("所有病人已诊治完成。\n");

    // 释放队列内存
    free(queue.data);

    return 0;
}