xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-24 10:56:29 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

Merge 2f73e9b770 into 2a9db6d039

Browse source
This commit is contained in:
pzpz 2024-11-25 19:21:33 +08:00 committed by GitHub
commit 20b047b916
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
1 changed files with 14 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

21
codes/c/chapter_stack_and_queue/array_queue.c
View file

@ -73,7 +73,14 @@ int pop(ArrayQueue *queue) {
queue->queSize--;
return num;
}
void print_queue(ArrayQueue *queue)
{
int tmp =queue->front;
int rear =(queue->front+queue->queSize-1)%queue->queCapacity;
for(;tmp != rear;tmp++,tmp%=queue->queCapacity)
printf("%d,",queue->nums[tmp]);
printf("%d]\n",queue->nums[rear]);
}
/* Driver Code */
int main() {
/* 初始化队列 */
@ -86,7 +93,7 @@ int main() {
push(queue, 2);
push(queue, 5);
push(queue, 4);
printf("队列 queue = ");
printf("队列 queue = [");
printArray(queue->nums, queue->queSize);
/* 访问队首元素 */
@ -95,8 +102,8 @@ int main() {
/* 元素出队 */
peekNum = pop(queue);
printf("出队元素 pop = %d ，出队后 queue = ", peekNum);
printArray(queue->nums, queue->queSize);
printf("出队元素 pop = %d ，出队后 queue = [", peekNum);
print_queue(queue);
/* 获取队列的长度 */
int queueSize = size(queue);
@ -110,12 +117,12 @@ int main() {
for (int i = 0; i < 10; i++) {
push(queue, i);
pop(queue);
printf("第 %d 轮入队 + 出队后 queue = ", i);
printArray(queue->nums, queue->queSize);
printf("第 %d 轮入队 + 出队后 queue = [", i);
print_queue(queue);
}
// 释放内存
delArrayQueue(queue);
return 0;
}
}