Fortune Smiles On Me

#include #include #define array_len 100 int arr[array_len]; int front = 0; int rear = 0; void enqueue(int data){ arr[rear++] = data; } int dequeue(void){ if (front == rear){ printf("비어있음\n"); exit(1); } return arr[front++]; } int main(void){ enqueue(3); enqueue(5); enqueue(2); enqueue(6); printf("%d\n", dequeue()); printf("%d\n", dequeue()); printf("%d\n", dequeue()); printf("%d\n", dequeue()); ..

#include #include "stack_list.h" void StackInit(Stack *pstack){ pstack->head = NULL; } int SIsEmpty(Stack *pstack){ if (pstack->head == NULL){ return TRUE; } else return FALSE; } void Spush(Stack *pstack, int data ){ Node* newNode = (Node*)malloc(sizeof(Node)); newNode->data = data; newNode->next = pstack->head; pstack->head = newNode; } DATA Spop(Stack *pstack){ DATA rdata; Node *rnode; if (SIs..

#include #include #include "stack.h" void StackInit(Stack *pstack){ pstack->top_index = -1; pstack->Stack_Arr[STACK_LEN]; } int SisEmpty(Stack *pstack){ if (pstack->top_index == -1) // 스택이 비었을 경우 return 1; else return 0; } void StackPush(Stack* pstack, int data) { //pstack->top_index++; pstack->top_index = pstack->top_index + 1; pstack->Stack_Arr[pstack->top_index] = data; } DATA StackPop(Stack*..