queue 구현하기를 하고 있는데 막히는 부분이 있어서 질문 올립니다!

Question

#define MAX_SIZE 10int queue[MAX_SIZE];int rear = -1;int front = -1;int queue_full() { if (rear == MAX_SIZE - 1) return 1; return 0;}int queue_empty() { if (front == rear) return 1; return 0;}void enqueue(int x) { if (queue_full()) { printf("queue full! "); return; } rear++; queue[rear] = x;}int dequeue() { if (queue_empty()) { printf("queue empty! "); return -1; } int temp = queue[front]; front++; return temp;}void print_queue() { printf("queue = "); if (queue_empty()) { printf("empty"); } else { for (int i = front; i <= rear; i++) { printf("%d ", queue[i]); } } printf("(rear=%d) ", rear);}void run_enqueuees(int arr[], int num) { for (int i = 0; i < num; i++) { printf("enqueue(%d) , ", arr[i]); enqueue(arr[i]); print_queue(); }}void run_dequeues(int num) { int value; for (int i = 0; i < num; i++) { printf("dequeue() "); value = dequeue(); if (value == -1) { printf(" "); continue; } printf("-> %d , ", value); print_queue(); }}int main() { int numbers[] = { 3, 9, 4, 5, 2, 1, 6, 8, 7, 5, 8 }; print_queue(); run_enqueuees(numbers, 5); run_dequeues(10); run_enqueuees(numbers, 5); run_dequeues(3); return 0;}이렇게 작성했는데queue = empty(rear=-1)enqueue(3) , queue = 0 3 (rear=0)enqueue(9) , queue = 0 3 9 (rear=1)enqueue(4) , queue = 0 3 9 4 (rear=2)enqueue(5) , queue = 0 3 9 4 5 (rear=3)enqueue(2) , queue = 0 3 9 4 5 2 (rear=4)dequeue() -> 0 , queue = 3 9 4 5 2 (rear=4)dequeue() -> 3 , queue = 9 4 5 2 (rear=4)dequeue() -> 9 , queue = 4 5 2 (rear=4)dequeue() -> 4 , queue = 5 2 (rear=4)dequeue() -> 5 , queue = empty(rear=4)dequeue() queue empty!dequeue() queue empty!dequeue() queue empty!dequeue() queue empty!dequeue() queue empty!enqueue(3) , queue = 2 3 (rear=5)enqueue(9) , queue = 2 3 9 (rear=6)enqueue(4) , queue = 2 3 9 4 (rear=7)enqueue(5) , queue = 2 3 9 4 5 (rear=8)enqueue(2) , queue = 2 3 9 4 5 2 (rear=9)dequeue() -> 2 , queue = 3 9 4 5 2 (rear=9)dequeue() -> 3 , queue = 9 4 5 2 (rear=9)dequeue() -> 9 , queue = 4 5 2 (rear=9)이렇게 출력되더라구용... 2번째 줄부터 0들어 가는지도 모르겠고 두번째 enqueue에는 왜 2가 그대로 남아있으며... run_enqueuees(numbers+5, 5);가 아닌 run_enqueuees(numbers, 5);을 사용하면 다시 처음부터 3,9,4,5,2 가 들어오는지..답변달아주시면 감사하겠습니다ㅠㅠ 너무 머리가 안돌아가네요

데브폐인 · Answer

ChatGPT4 가 응답한 결과입니다.코드를 살펴보니, front 변수를 초기화하는 부분이 빠져 있어서 오류가 발생할 수 있습니다. 또한, 이 코드에서는 front가 항상 -1로 초기화되어 있어서, 실제로는 인덱스 0부터 시작해야 하는데, dequeue 함수에서 front가 0을 가리키지 않고 있습니다. 이러한 문제를 해결하기 위해 다음과 같이 코드를 수정하세요.front를 0으로 초기화합니다.dequeue 함수에서 반환할 값을 queue[front]로 수정하고, front 값을 증가시키기 전에 저장해두세요.수정된 코드는 다음과 같습니다: #include #define MAX_SIZE 10 int queue[MAX_SIZE]; int rear = -1; int front = 0; int queue_full() { if (rear == MAX_SIZE - 1) { return 1; } return 0; } int queue_empty() { if (front > rear) { return 1; } return 0; } void enqueue(int x) { if (queue_full()) { printf("queue full! "); return; } rear++; queue[rear] = x; } int dequeue() { if (queue_empty()) { printf("queue empty! "); return -1; } int temp = queue[front]; front++; return temp; } void print_queue() { printf("queue = "); if (queue_empty()) { printf("empty"); } else { for (int i = front; i <= rear; i++) { printf("%d ", queue[i]); } } printf("(rear=%d) ", rear); } void run_enqueuees(int arr[], int num) { for (int i = 0; i < num; i++) { printf("enqueue(%d) , ", arr[i]); enqueue(arr[i]); print_queue(); } } void run_dequeues(int num) { int value; for (int i = 0; i < num; i++) { printf("dequeue() "); value = dequeue(); if (value == -1) { printf(" "); continue; } printf("-> %d , ", value); print_queue(); } } int main() { int numbers[] = { 3, 9, 4, 5, 2, 1, 6, 8, 7, 5, 8 }; print_queue(); run_enqueuees(numbers, 5); run_dequeues(10); run_enqueuees(numbers, 5); run_dequeues(3); return 0; }출력결과 :queue = empty(rear=-1) enqueue(3) , queue = 3 (rear=0) enqueue(9) , queue = 3 9 (rear=1) enqueue(4) , queue = 3 9 4 (rear=2) enqueue(5) , queue = 3 9 4 5 (rear=3) enqueue(2) , queue = 3 9 4 5 2 (rear=4) dequeue() -> 3 , queue = 9 4 5 2 (rear=4) dequeue() -> 9 , queue = 4 5 2 (rear=4) dequeue() -> 4 , queue = 5 2 (rear=4) dequeue() -> 5 , queue = 2 (rear=4) dequeue() -> 2 , queue = empty(rear=4) dequeue() queue empty! dequeue() queue empty! dequeue() queue empty! dequeue() queue empty! dequeue() queue empty! enqueue(3) , queue = 3 (rear=5) enqueue(9) , queue = 3 9 (rear=6) enqueue(4) , queue = 3 9 4 (rear=7) enqueue(5) , queue = 3 9 4 5 (rear=8) enqueue(2) , queue = 3 9 4 5 2 (rear=9) dequeue() -> 3 , queue = 9 4 5 2 (rear=9) dequeue() -> 9 , queue = 4 5 2 (rear=9) dequeue() -> 4 , queue = 5 2 (rear=9)

박돌돌 · Answer

저는 rear와 front 의 인덱스를 그대로 두고 empty_queue()의 조건과 출력할때 0 보다 작을때만 수정했습니다. 정답은 아니니까 참고만 부탁드려요 #define MAX_SIZE 10 int queue[MAX_SIZE]; int rear = -1; int front = -1; int queue_full() { if (rear == MAX_SIZE - 1) return 1; return 0; } int queue_empty() { if (front > rear) return 1; return 0; } void enqueue(int x) { if (queue_full()) { printf("queue full! "); return; } rear++; queue[rear] = x; } int dequeue() { if (queue_empty()) { printf("queue empty! "); return -1; } int temp = queue[front]; front++; return temp; } void print_queue() { printf("queue = "); if (queue_empty()) { printf("empty"); } else { int i = front; if (i < 0){ i = 0; } for (i; i <= rear; i++) { printf("%d ", queue[i]); } } printf("(rear=%d)", rear); printf("(front=%d) ", front); } void run_enqueuees(int arr[], int num) { for (int i = 0; i < num; i++) { printf("enqueue(%d) , ", arr[i]); enqueue(arr[i]); print_queue(); } } void run_dequeues(int num) { int value; for (int i = 0; i < num; i++) { printf("dequeue() "); value = dequeue(); if (value == -1) { printf(" "); continue; } printf("-> %d , ", value); print_queue(); } } int main() { int numbers[] = { 3, 9, 4, 5, 2, 1, 6, 8, 7, 5, 8 }; print_queue(); run_enqueuees(numbers, 5); run_dequeues(10); run_enqueuees(numbers, 5); run_dequeues(3); return 0; }/tmp/9odsMF9nsA.o queue = (rear=-1)(front=-1) enqueue(3) , queue = 3 (rear=0)(front=-1) enqueue(9) , queue = 3 9 (rear=1)(front=-1) enqueue(4) , queue = 3 9 4 (rear=2)(front=-1) enqueue(5) , queue = 3 9 4 5 (rear=3)(front=-1) enqueue(2) , queue = 3 9 4 5 2 (rear=4)(front=-1) dequeue() -> 0 , queue = 3 9 4 5 2 (rear=4)(front=0) dequeue() -> 3 , queue = 9 4 5 2 (rear=4)(front=1) dequeue() -> 9 , queue = 4 5 2 (rear=4)(front=2) dequeue() -> 4 , queue = 5 2 (rear=4)(front=3) dequeue() -> 5 , queue = 2 (rear=4)(front=4) dequeue() -> 2 , queue = empty(rear=4)(front=5) dequeue() queue empty! dequeue() queue empty! dequeue() queue empty! dequeue() queue empty! enqueue(3) , queue = 3 (rear=5)(front=5) enqueue(9) , queue = 3 9 (rear=6)(front=5) enqueue(4) , queue = 3 9 4 (rear=7)(front=5) enqueue(5) , queue = 3 9 4 5 (rear=8)(front=5) enqueue(2) , queue = 3 9 4 5 2 (rear=9)(front=5) dequeue() -> 3 , queue = 9 4 5 2 (rear=9)(front=6) dequeue() -> 9 , queue = 4 5 2 (rear=9)(front=7) dequeue() -> 4 , queue = 5 2 (rear=9)(front=8)

queue 구현하기를 하고 있는데 막히는 부분이 있어서 질문 올립니다!

2개의 답변

Q&A 목록