fork download
  1. #include <stdio.h>
  2.  
  3. #define SIZE 5
  4. int queue[SIZE];
  5. int head, tail;
  6.  
  7.  
  8. void enqueue(int value);
  9. int dequeue(void);
  10.  
  11. int main(void){
  12.  
  13. head = tail = 0;
  14. int data, i;
  15.  
  16.  
  17. enqueue(1);
  18. enqueue(2);
  19. dequeue();
  20. enqueue(3);
  21. dequeue();
  22. enqueue(4);
  23. enqueue(5);
  24. dequeue();
  25. enqueue(6);
  26.  
  27. for(i = 0; i < SIZE; i++){
  28. printf("queue[%d]=%d\n", i, queue[i]);
  29. }
  30.  
  31. return 0;
  32. }
  33. void enqueue(int value)
  34. {
  35. if(head == (tail + 1) % SIZE){
  36. printf("キューは満杯です: %dを格納できません\n", value);
  37. return;
  38. }
  39.  
  40. queue[tail] = value;
  41.  
  42. tail = (tail + 1) % SIZE;
  43. }
  44.  
  45. int dequeue(void)
  46. {
  47. int data;
  48.  
  49. if (head == tail) {
  50. printf("キューは空です\n");
  51. return -1;
  52. }
  53.  
  54. data = queue[head];
  55.  
  56. queue[head] = 0;
  57.  
  58. head = (head + 1) % SIZE;
  59.  
  60. return data;
  61. }
Success #stdin #stdout 0s 5320KB
stdin
Standard input is empty
stdout
queue[0]=6
queue[1]=0
queue[2]=0
queue[3]=4
queue[4]=5