更新
This commit is contained in:
		
							
								
								
									
										36
									
								
								数据结构/队列/main.c
									
									
									
									
									
										Normal file
									
								
							
							
						
						
									
										36
									
								
								数据结构/队列/main.c
									
									
									
									
									
										Normal file
									
								
							| @@ -0,0 +1,36 @@ | ||||
| #include "queue.h" | ||||
| #include <stdio.h> | ||||
|  | ||||
| int main(){ | ||||
|  | ||||
|     int a[10];                      //创建队列容器 | ||||
|     SqQuecu a_quecu;                //初始化队列 | ||||
|     InitQuecu(&a_quecu,10,sizeof(int),(void*)a); | ||||
|     //出队进队测试 | ||||
|     int *tmep;//临时存储进对的返回值 | ||||
|     for (size_t i = 0; i < 50; i++) | ||||
|     { | ||||
|         tmep = (int*)enQueue(&a_quecu); | ||||
|         if(tmep!=NULL){                         //返回值为空指针则对满 | ||||
|             *tmep=i; | ||||
|         } | ||||
|         else{ | ||||
|             printf("出队元素:%d\n",*(int*)deQueue(&a_quecu)); | ||||
|             *(int*)enQueue(&a_quecu)=i;                             //出队后重新进队 | ||||
|         } | ||||
|         for(int i=0;i<10;i++) | ||||
|         printf("%d\n",a[i]); | ||||
|  | ||||
|         printf("-------------------------\n"); | ||||
|  | ||||
|     } | ||||
|  | ||||
|     //连续退队测试 | ||||
|     for(int i=0;i<5;i++){ | ||||
|         printf("出队元素:%d\n",*(int*)deQueue(&a_quecu)); | ||||
|         printf("当前队列长度:%d\n",a_quecu.size); | ||||
|     } | ||||
|  | ||||
|     return 0; | ||||
|  | ||||
| } | ||||
		Reference in New Issue
	
	Block a user