#66. [백준_C언어] 18258 : 큐 2 \ 큐, 덱

 

 입력 코드 

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

int main() {
	int n;
	scanf("%d", &n);

	int queue[2000000];
	int front = 0, back = 0;
	char command[6];
	for (int i = 0; i<n; i++) {
		scanf("%s", command);
		if (strncmp(command, "push", 4) == 0) {
			int num;
			scanf("%d", &num);
			queue[front] = num;
			front += 1;
		}
		else if (strncmp(command, "pop", 3) == 0) {
			if (front == back) printf("-1\n");
			else {
				printf("%d\n", queue[back]);
				back += 1;
			}
		}
		else if (strncmp(command, "size", 4) == 0) {
			printf("%d\n", front - back);
		}
		else if (strncmp(command, "empty", 5) == 0) {
			if (front == back) printf("1\n");
			else printf("0\n");
		}
		else if (strncmp(command, "front", 5) == 0) {
			if (front == back) printf("-1\n");
			else printf("%d\n", queue[back]);
		}
		else if (strncmp(command, "back", 4) == 0) {
			if (front == back) printf("-1\n");
			else printf("%d\n", queue[front - 1]);
		}
	}

	return 0;
}

출처 www.acmicpc.net/source/17560588

 

 

 

 코드 설명 

#자료구조 #큐

 

 

References

daily-life-in-20s.tistory.com/79

#61. [백준_C언어] 10845 : 큐

daily-life-in-20s.tistory.com/92

#01. [문자열 비교하기] strcmp 함수, strncmp 함수

 

 

 문제 출처 

www.acmicpc.net/problem/18258

18258번: 큐 2