fork download
  1. #include <stdio.h>
  2.  
  3. #define SIZE 5
  4. int queue[SIZE];
  5. int head, tail;
  6.  
  7. void enqueue(int value) {
  8. if ((tail + 1) % SIZE == head) {
  9. printf("満杯です\n");
  10. return;
  11. }
  12. queue[tail] = value;
  13. tail = (tail + 1) % SIZE;
  14. }
  15.  
  16.  
  17. int dequeue(void) {
  18. if (head == tail) {
  19. printf("空です\n");
  20. return -1;
  21. }
  22. int value = queue[head];
  23. queue[head] = 0;
  24. head = (head + 1) % SIZE;
  25. return value;
  26. }
  27.  
  28. int main(void) {
  29. head = tail = 0;
  30.  
  31. enqueue(1);
  32. enqueue(2);
  33. dequeue();
  34. enqueue(3);
  35. dequeue();
  36. enqueue(4);
  37. enqueue(5);
  38. dequeue();
  39. enqueue(6);
  40.  
  41. for (int i = 0; i < SIZE; i++)
  42. printf("queue[%d] = %d\n", i, queue[i]);
  43.  
  44. return 0;
  45. }
  46.  
Success #stdin #stdout 0.01s 5324KB
stdin
Standard input is empty
stdout
queue[0] = 6
queue[1] = 0
queue[2] = 0
queue[3] = 4
queue[4] = 5