목록백준/백준-C (24)
VioletaBabel
#include #include #include int q[10000];int start = 0, end = 0, count = 0; void push(int x);void pop();void size();void empty();void front();void back(); void push(int x){q[end++] = x;++count;}void pop(){if (count != 0){printf("%d\n", q[start++]);--count;}elseprintf("-1\n");}void size(){printf("%d\n", count);}void empty(){if (count == 0)printf("1\n");elseprintf("0\n");}void front(){if (count != ..
스택을 안써도 그냥 count 매기는걸로 풀 수 있을 것 같지만, 분류가 스택이길래 스택 함수까지 해보았다. #include #include //malloc#include #define mal (node *)malloc(sizeof(node))typedef struct _node{int data;struct _node *next;}node; node *head, *end, *indexnode;int count = 0;void push(int num);void pop(); void push(int num){indexnode = (node *)malloc(sizeof(node));indexnode->data = num;indexnode->next = head->next;head->next = indexnod..
#include #include //malloc#include #define mal (node *)malloc(sizeof(node))typedef struct _node{int data;struct _node *next;}node; node *head, *end, *indexnode;void push(int num);void pop(); void push(int num){indexnode = (node *)malloc(sizeof(node));indexnode->data = num;indexnode->next = head->next;head->next = indexnode;printf("+\n");} void pop(){indexnode = head->next;head->next = indexnode-..
#include #include //malloc#include #define mal (node *)malloc(sizeof(node))typedef struct _node{int data;struct _node *next;}node; node *head, *end, *indexnode;int count = 0;void push(int num);void pop();void size();void empty();void top(); void push(int num){indexnode = (node *)malloc(sizeof(node));indexnode->data = num;indexnode->next = head->next;head->next = indexnode;++count;} void pop(){in..