fork 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 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.     if( head == (tail+1)%SIZE ){
  35.         printf("キューは満杯で入りませんでした\n");
  36.     }else{
  37.         queue[tail] = value;
  38.         tail = tail + 1;
  39.     }
  40.     tail = tail % SIZE;
  41. }
  42.  
  43. int dequeue(void)
  44. {
  45.     int value;
  46.     if( head == tail ){
  47.         printf("キューは空で取り出せませんでした\n");
  48.         return 0;
  49.     }else{
  50.         value = queue[head];
  51.         queue[head] = 0;        //抽出後に0を代入
  52.         head = head + 1;
  53.     }
  54.     head = head % SIZE;
  55.     return value;
  56. }
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin 
Standard input is empty
stdout 
queue[0]=6
queue[1]=0
queue[2]=0
queue[3]=4
queue[4]=5
https://ideone.com/WohG1N
language:
C (gcc 8.3)
created:
12 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!