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 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. {
  34.    if(head == (tail+1)%SIZE){
  35.    	printf("キューは満杯\n");
  36.  
  37.    }else{
  38.    	queue[tail++] = value;
  39.    }
  40.    tail=tail%SIZE;
  41.  
  42.  
  43.  
  44.  
  45.  
  46. }
  47.  
  48. int dequeue(void)
  49. {
  50.     int value;
  51. 	if( head == tail ){
  52. 		printf("キューは空で取り出せませんでした\n");
  53. 		return 0;
  54. 	}else{
  55. 		value = queue[head];
  56. 		queue[head]=0;
  57. 		head++;
  58. 	}
  59.  
  60. 	head = head % SIZE;
  61. 	return value;
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70. }
  71.  
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/NKq1mu
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!