xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-10 22:46:07 +00:00
Code Issues Packages Projects Releases Wiki Activity

fine tune

Browse Source
This commit is contained in:
krahets
2023-09-17 01:13:15 +08:00
parent b2246e11a7
commit 9f59c572b5
32 changed files with 44 additions and 44 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/c/chapter_stack_and_queue/array_deque.c
+2 -2
View File
@@ -150,10 +150,10 @@ int main() {
/* 元素出队 */
int popLastNum = popLast(deque);
printf("队尾出队元素 = %d，队尾出队后 deque= ", popLastNum);
printf("队尾出队元素 = %d ，队尾出队后 deque= ", popLastNum);
printArrayDeque(deque);
int popFirstNum = popFirst(deque);
printf("队首出队元素 = %d，队首出队后 deque= ", popFirstNum);
printf("队首出队元素 = %d ，队首出队后 deque= ", popFirstNum);
printArrayDeque(deque);
/* 获取队列的长度 */
codes/c/chapter_stack_and_queue/array_queue.c
+1 -1
View File
@@ -106,7 +106,7 @@ int main() {
/* 元素出队 */
pop(queue);
printf("出队元素 pop = %d，出队后 queue = ", peekNum);
printf("出队元素 pop = %d ，出队后 queue = ", peekNum);
printArrayQueue(queue);
/* 获取队列的长度 */
codes/c/chapter_stack_and_queue/array_stack.c
+1 -1
View File
@@ -85,7 +85,7 @@ int main() {
/* 元素出栈 */
val = pop(stack);
printf("出栈元素 pop = %d，出栈后 stack = ", val);
printf("出栈元素 pop = %d ，出栈后 stack = ", val);
printArray(stack->data, stack->size);
/* 获取栈的长度 */
codes/c/chapter_stack_and_queue/linkedlist_deque.c
+2 -2
View File
@@ -194,10 +194,10 @@ int main() {
/* 元素出队 */
int popLastNum = popLast(deque);
printf("队尾出队元素 popLast = %d，队尾出队后 deque = ", popLastNum);
printf("队尾出队元素 popLast = %d ，队尾出队后 deque = ", popLastNum);
printLinkedListDeque(deque);
int popFirstNum = popFirst(deque);
printf("队首出队元素 popFirst = %d，队首出队后 deque = ", popFirstNum);
printf("队首出队元素 popFirst = %d ，队首出队后 deque = ", popFirstNum);
printLinkedListDeque(deque);
/* 获取队列的长度 */
codes/c/chapter_stack_and_queue/linkedlist_queue.c
+1 -1
View File
@@ -110,7 +110,7 @@ int main() {
/* 元素出队 */
pop(queue);
printf("出队元素 pop = %d，出队后 queue = ", peekNum);
printf("出队元素 pop = %d ，出队后 queue = ", peekNum);
printLinkedListQueue(queue);
/* 获取队列的长度 */