fork download
  1. #include <stdio.h>
  2.  
  3. #define SIZE 5
  4.  
  5. int queue[SIZE];
  6. int head, tail;
  7.  
  8. void enqueue(int value);
  9. int dequeue(void);
  10.  
  11. int main(void) {
  12. int i;
  13.  
  14. head = tail = 0;
  15.  
  16. enqueue(1);
  17. enqueue(2);
  18. dequeue();
  19. enqueue(3);
  20. dequeue();
  21. enqueue(4);
  22. enqueue(5);
  23. dequeue();
  24. enqueue(6);
  25.  
  26. for(i = 0; i < SIZE; i++){
  27. printf("queue[%d] = %d\n", i, queue[i]);
  28. }
  29.  
  30. return 0;
  31. }
  32.  
  33. void enqueue(int value){
  34. if(head == (tail + 1) % SIZE){
  35. printf("満杯の状態です。\n");
  36. }
  37. else{
  38. queue[tail] = value;
  39. tail = (tail + 1) % SIZE;
  40. }
  41. }
  42.  
  43. int dequeue(void){
  44. int value;
  45.  
  46. if(head == tail){
  47. printf("キューは空です。\n");
  48. return -1;
  49. }
  50. else{
  51. value = queue[head]; // ① 先に取り出す
  52. queue[head] = 0; // ② 表示用に消す
  53. head = (head + 1) % SIZE; // ③ head を進める
  54. return value;
  55. }
  56. }
  57.  
  58.  
Success #stdin #stdout 0.01s 5272KB
stdin
Standard input is empty
stdout
queue[0] = 6
queue[1] = 0
queue[2] = 0
queue[3] = 4
queue[4] = 5