github/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Bug fixes

Browse Source
This commit is contained in:
krahets 2024-05-11 15:30:33 +08:00
parent 2c70dcd621
commit afa4986ac3
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
codes/c/chapter_stack_and_queue/array_stack.c
View File

@ -90,11 +90,11 @@ int main() {
/* 获取栈的长度 */
int size = stack->size;
printf("栈的长度 size = %d\n", size);
printf("栈的长度 size = %d\n", size);
/* 判断是否为空 */
bool empty = isEmpty(stack);
printf("栈是否为空 = %stack\n", empty ? "true" : "false");
printf("栈是否为空 = %s\n", empty ? "true" : "false");
// 释放内存
delArrayStack(stack);

2
en/docs/chapter_array_and_linkedlist/summary.md
View File

@ -74,7 +74,7 @@ On the other hand, linked lists are primarily necessary for binary trees and gra
**Q**: Does initializing a list `res = [0] * self.size()` result in each element of `res` referencing the same address?
No. However, this issue arises with two-dimensional arrays, for example, initializing a two-dimensional list `res = [[0] * self.size()]` would reference the same list `[0]` multiple times.
No. However, this issue arises with two-dimensional arrays, for example, initializing a two-dimensional list `res = [[0]] * self.size()` would reference the same list `[0]` multiple times.
**Q**: In deleting a node, is it necessary to break the reference to its successor node?