fork(1) 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. int data, i;
  14.  
  15. enqueue(1);
  16. enqueue(2);
  17. dequeue();
  18. enqueue(3);
  19. dequeue();
  20. enqueue(4);
  21. enqueue(5);
  22. dequeue();
  23. enqueue(6);
  24.  
  25. for(i=0; i<SIZE; i++){
  26. printf("queue[%d]=%d\n", i, queue[i] );
  27. }
  28.  
  29. return 0;
  30. }
  31.  
  32. void enqueue(int value) {
  33. if (head == (tail + 1) % SIZE) {
  34. printf("Queue is full\n");
  35. return;
  36. }
  37. queue[tail] = value;
  38. tail = (tail + 1) % SIZE;
  39.  
  40.  
  41. }
  42.  
  43. int dequeue(void)
  44. {
  45. int value;
  46. if (head == tail) {
  47. printf("Queue is empty\n");
  48. return -1;
  49. }
  50. value = queue[head];
  51. queue[head] = 0; // 抽出した場所を初期値0に
  52. head = (head + 1) % SIZE;
  53. return value;
  54. }
  55.  
  56.  
  57.  
  58.  
  59.  
Success #stdin #stdout 0s 5304KB
stdin
Standard input is empty
stdout
queue[0]=6
queue[1]=0
queue[2]=0
queue[3]=4
queue[4]=5