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.     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.     return 0;
  29. }
  30.  
  31. void enqueue(int value) {
  32.     if(head == (tail + 1) % SIZE) {
  33.         printf("キューは満杯\n");
  34.     } else {
  35.         queue[tail++] = value;
  36.         tail = tail % SIZE;
  37.     }
  38. }
  39.  
  40. int dequeue(void) {
  41.     int value;
  42.     if(head == tail) {
  43.         printf("キューは空です\n");
  44.         return -1;
  45.     } else {
  46.         value = queue[head];
  47.         queue[head] = 0;   // 抽出した場所を初期化
  48.         head++;
  49.         head = head % SIZE;
  50.     }
  51.     return value;
  52. }
Success #stdin #stdout 0s 5308KB
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/o9FI9x
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!