题解 | #【模板】队列#

【模板】队列

https://www.nowcoder.com/practice/afe812c80ad946f4b292a26dd13ba549?tpId=308&tqId=2110348&ru=%2Fpractice%2Fa9fec6c46a684ad5a3abd4e365a9d362&qru=%2Fta%2Falgorithm-start%2Fquestion-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E7%25AE%2597%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D295

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
#include <string.h>
#define MAX 100000
int main() {
    int front = 0, rear = 0;
    int Q[MAX] = {0};
    int n;
    scanf("%d", &n);
    while (n--) {
        char a[10];
        scanf("%s",a);
        if (!strcmp(a, "push")) {
            int x;
            scanf("%d", &x);
            Q[rear++] = x;
        }
        if (!strcmp(a, "pop")) {
            if (front == rear)
                printf("error\n");
            else {
                printf("%d\n", Q[front++]);
            }

        }
        if (!strcmp(a, "front")) {
            if (front == rear)
                printf("error\n");
            else {
                printf("%d\n", Q[front]);
            }

        }

    }
    return 0;
}

全部评论

相关推荐

评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客企业服务