数据结构，队列 C语言

利用顺序存储结构设计一个核酸检测队列管理程序
要记录每个参检人员的姓名和身份证号，并通过数字化菜单。可以入队，出队，输入身份证查找，输出所有人信息按照身份证排序，显示队伍状态预警。出队检测。可以一次安排10人混检，也可以安排单检。出队检测后，人员的信息从排队人员中删除。

#include <stdio.h>
#include <string.h>

#define QUEUE_SIZE 1000

struct Person {
    char name[100];
    char id[100];
};

struct Person queue[QUEUE_SIZE];
int front = 0, rear = 0;

void enqueue(struct Person p) {
    if (rear == QUEUE_SIZE) {
        printf("Queue is full!\n");
        return;
    }
    queue[rear] = p;
    rear++;
}

struct Person dequeue() {
    if (front == rear) {
        printf("Queue is empty!\n");
        return;
    }
    struct Person p = queue[front];
    front++;
    return p;
}

void search(char* id) {
    for (int i = front; i < rear; i++) {
        if (strcmp(queue[i].id, id) == 0) {
printf("Person found: name = %s, id = %s\n", queue[i].name, queue[i].id);
return;
}
}
printf("Person not found!\n");
}

void sort() {
for (int i = front; i < rear - 1; i++) {
for (int j = i + 1; j < rear; j++) {
if (strcmp(queue[i].id, queue[j].id) > 0) {
struct Person temp = queue[i];
queue[i] = queue[j];
queue[j] = temp;
}
}
}
}

void display_warning() {
int remaining = QUEUE_SIZE - (rear - front);
if (remaining < QUEUE_SIZE * 0.1) {
printf("队伍状态较拥挤\n");
} else if (remaining < QUEUE_SIZE * 0.05) {
printf("队伍状态十分拥挤\n");
} else {
printf("队伍状态较稳定\n");
}
}

void check(int mode) {
if (mode == 1) {
for (int i = 0; i < 10; i++) {
if (front == rear) {
printf("Queue is empty!\n");
return;
}
dequeue();
}
} else if (mode == 2) {
if (front == rear) {
printf("Queue is empty!\n");
return;
}
dequeue();
}
}

int main() {
// 按照你的需求实现其他功能

Copy code
return 0;
}

• 请看👉 ：数据结构C语言

完整代码实现如下，望采纳。有问题可以随时再沟通。

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX_QUEUE_SIZE 100
#define ID_LEN 18
#define NAME_LEN 50
typedef struct {
    char name[NAME_LEN];
    char id[ID_LEN];
}
Person;
typedef struct {
    Person queue[MAX_QUEUE_SIZE];
    int front;
    int rear;
}
Queue;
void init_queue(Queue *q);
int is_full(Queue *q);
int enqueue(Queue *q, Person p);
int is_empty(Queue *q);
int dequeue(Queue *q, Person *p);
void sort_queue(Queue *q);
void display_queue(Queue *q);
int search_queue(Queue *q, char *id, Person *p);
int main(int argc, char *argv[]) {
    Queue queue;
    init_queue(&queue);
    while (1) {
        int selection;
        printf("1. 入队\n");
        printf("2. 出队\n");
        printf("3. 查找\n");
        printf("4. 显示所有人信息\n");
        printf("5. 排序\n");
        printf("6. 退出\n");
        printf("请选择: ");
        scanf("%d", &selection);
        switch (selection) {
            case 1: {
                if (is_full(&queue)) {
                    printf("Queue is full.\n");
                    break;
                }
                Person p;
                printf("Enter name: ");
                scanf("%s", p.name);
                printf("Enter ID: ");
                scanf("%s", p.id);
                int result = enqueue(&queue, p);
                if (result == 1) {
                    printf("Enqueued successfully.\n");
                } else {
                    printf("Failed to enqueue.\n");
                }
                break;
            }
            case 2: {
                if (is_empty(&queue)) {
                    printf("Queue is empty.\n");
                    break;
                }
                Person p;
                int result = dequeue(&queue, &p);
                if (result == 1) {
                    printf("Dequeued successfully.\n");
                    printf("Name: %s\n", p.name);
                    printf("ID: %s\n", p.id);
                } else {
                    printf("Failed to dequeue.\n");
                }
                break;
            }
            case 3: {
                char id[ID_LEN];
                printf("Enter ID: ");
                scanf("%s", id);
                Person p;
                int result = search_queue(&queue, id, &p);
                if (result == 1) {
                    printf("Name: %s\n", p.name);
                    printf("ID: %s\n", p.id);
                } else {
                    printf("Person not found.\n");
                }
                break;
            }
            case 4: {
                display_queue(&queue);
                break;
            }
            case 5
            : {
                sort_queue(&queue);
                printf("Queue sorted.\n");
                break;
            }
            case 6: {
                exit(0);
            }
            default: {
                printf("Invalid selection.\n");
            }
        }
    }
    return 0;
}
void init_queue(Queue *q) {
    q->front = 0;
    q->rear = 0;
}
int is_full(Queue *q) {
    return (q->rear + 1) % MAX_QUEUE_SIZE == q->front;
}
int enqueue(Queue *q, Person p) {
    if (is_full(q)) {
        return 0;
    }
    q->queue[q->rear] = p;
    q->rear = (q->rear + 1) % MAX_QUEUE_SIZE;
    return 1;
}
int is_empty(Queue *q) {
    return q->front == q->rear;
}
int dequeue(Queue *q, Person *p) {
    if (is_empty(q)) {
        return 0;
    }
    *p = q->queue[q->front];
    q->front = (q->front + 1) % MAX_QUEUE_SIZE;
    return 1;
}
void sort_queue(Queue *q) {
    int i, j;
    for (i = q->front; i != q->rear; i = (i + 1) % MAX_QUEUE_SIZE) {
        for (j = (i + 1) % MAX_QUEUE_SIZE; j != q->rear; j = (j + 1) % MAX_QUEUE_SIZE) {
            if (strcmp(q->queue[i].id, q->queue[j].id) > 0) {
                Person temp = q->queue[i];
                q->queue[i] = q->queue[j];
                q->queue[j] = temp;
            }
        }
    }
}
void display_queue(Queue *q) {
    int i;
    for (i = q->front; i != q->rear; i = (i + 1) % MAX_QUEUE_SIZE) {
        printf("Name: %s\n", q->queue[i].name);
        printf("ID: %s\n", q->queue[i].id);
    }
}
int search_queue(Queue *q, char *id, Person *p) {
    int i;
    for (i = q->front; i != q->rear; i = (i + 1) % MAX_QUEUE_SIZE) {
        if (strcmp(q->queue[i].id, id) == 0) {
            *p = q->queue[i];
            return 1;
        }
    }
    return 0;
}