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. int dequeue(void);
  9.  
  10. int main(void)
  11. {
  12. head = tail = 0;
  13.  
  14. enqueue(1);
  15. enqueue(2);
  16. dequeue();
  17. enqueue(3);
  18. dequeue();
  19. enqueue(4);
  20. enqueue(5);
  21. dequeue();
  22. enqueue(6);
  23.  
  24. for (int i = 0; i < SIZE; i++) {
  25. printf("queue[%d]=%d\n", i, queue[i]);
  26. }
  27.  
  28. return 0;
  29. }
  30.  
  31. void enqueue(int value)
  32. {
  33. int next = (tail + 1) % SIZE;
  34.  
  35.  
  36. if (next == head) {
  37. printf("Queue is FULL. enqueue(%d) できません\n", value);
  38. return;
  39. }
  40.  
  41. queue[tail] = value;
  42. tail = next;
  43. }
  44.  
  45. int dequeue(void)
  46. {
  47. if (head == tail) {
  48. printf("Queue is EMPTY. dequeue できません\n");
  49. return -1;
  50. }
  51.  
  52. int data = queue[head];
  53. queue[head] = 0;
  54. head = (head + 1) % SIZE;
  55.  
  56. return data;
  57. }
  58.  
Success #stdin #stdout 0s 5316KB
stdin
Standard input is empty
stdout
queue[0]=6
queue[1]=0
queue[2]=0
queue[3]=4
queue[4]=5