fork download
copy 
  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 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. {
  34.     // 満杯判定: headがtail+1のとき
  35.     if ((tail + 1) % SIZE == head) {
  36.         printf("満杯で入れません\n");
  37.         return;
  38.     }
  39.  
  40.     queue[tail] = value;
  41.     tail = (tail + 1) % SIZE;
  42. }
  43.  
  44. int dequeue(void)
  45. {
  46.     int value;
  47.  
  48.     // 空判定: headとtailが同じ
  49.     if (head == tail) {
  50.         printf("空で取り出せません\n");
  51.         return 0;
  52.     }
  53.  
  54.     value = queue[head];
  55.     queue[head] = 0;   // 取り出した場所を初期化
  56.     head = (head + 1) % SIZE;
  57.  
  58.     return value;
  59. }
Success #stdin #stdout 0s 5308KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
queue[0]=6
queue[1]=0
queue[2]=0
queue[3]=4
queue[4]=5
https://ideone.com/Ke6ENc
language:
C (gcc 8.3)
created:
11 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!