#68. [백준_C언어] 1021 : 회전하는 큐 \ 자료구조

입력 코드 #include int q[451]; int main() { int head,tail,i,j,n,m,cnt=0,x; scanf("%d%d",&n,&m); for(i=1;i

• format_list_bulleted C
• · 2021. 2. 9.
• textsms

#67. [백준_C언어] 1966 : 프린터 큐 \ 큐, 덱

입력 코드 #include int findMax(int queue[], int N, int front, int rear){ int M = queue[front], index = 0; for (int i = front + 1; i

• format_list_bulleted C
• · 2021. 2. 8.
• textsms

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

입력 코드 #include #include #include int main() { int n; scanf("%d", &n); int queue[2000000]; int front = 0, back = 0; char command[6]; for (int i = 0; i

• format_list_bulleted C
• · 2021. 2. 8.
• textsms

#62. [백준_C언어] 10866 : 덱

입력 코드 #include #include #include typedef struct deque{ int num; struct deque* next; struct deque* parent; }deq; deq* front=NULL; deq* back=NULL; int main(){ int N,X,size=0; deq* a; deq* del; char sym[11]; scanf("%d",&N); while(N--){ scanf("%s",sym); if(!strcmp(sym,"push_front")){ scanf("%d",&X); a=(deq*)malloc(sizeof(deq)); a->num=X; a->parent=NULL;a->next=NULL; if(front!=NULL){ front->parent=a;..

• format_list_bulleted C
• · 2021. 2. 2.
• textsms