fork(1) 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 data, i;
  14.  
  15.     enqueue(1);//[1,-,-,-,-]
  16.     enqueue(2);//[1,2,-,-,-]
  17.     dequeue();//[0,2,-,-,-]
  18.     enqueue(3);//[0,2,3,-,-]
  19.     dequeue();//[0,0,3,-,-]
  20.     enqueue(4);//[0,0,3,4,-]
  21.     enqueue(5);//[0,0,3,4,5]
  22.     dequeue();//[0,0,0,4,5]
  23.     enqueue(6);//[0,0,0,4,5,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.     int next = (tail + 1) % SIZE;
  34.     if (next == head) {
  35.         printf("キューが満杯です\n");
  36.     }
  37.     queue[tail] = value;
  38.     tail = next;
  39. }
  40. int dequeue(void) {
  41.     if (head == tail) {
  42.         printf("キューが空です\n");
  43.         return -1;
  44.     }
  45.     int value = queue[head];
  46.     queue[head] = 0;
  47.     head = (head + 1) % SIZE;
  48.     return value;
  49. }
Success #stdin #stdout 0s 5288KB
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/r67iDP
language:
C (gcc 8.3)
created:
56 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!