fork download
  1. #include <stdio.h>
  2. #define SIZE 5
  3. int queue[SIZE];
  4. int head,tail;
  5.  
  6. void enqueue(int value);
  7. int dequeue(void);
  8.  
  9. int main(void)
  10. {
  11. head = tail = 0;
  12. int i;
  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(i=0;i<SIZE;i++){
  25. printf("queue[%d]=%d\n",i,queue[i]);
  26. }
  27.  
  28.  
  29. return 0;
  30. }
  31. void enqueue(int value)
  32. {
  33. if( head == (tail+1)%SIZE){
  34. printf("キューは満杯で入りません\n");
  35. }else{
  36. queue[tail++] = value;
  37. }
  38. tail = tail % SIZE;
  39. }
  40. int dequeue(void)
  41. {
  42. int value;
  43. if( head == tail){
  44. printf("キューは空で取り出せません\n");
  45. return 0;
  46. }else{
  47. value = queue[head];
  48. queue[head] = 0;
  49. }
  50. head = (head + 1) % SIZE;
  51. return value;
  52.  
  53. }
  54.  
Success #stdin #stdout 0.01s 5280KB
stdin
Standard input is empty
stdout
queue[0]=6
queue[1]=0
queue[2]=0
queue[3]=4
queue[4]=5