Skip to content

修复甲级 1159 题内存泄漏的 bug，并添加甲级 1156 到 1159 题的索引 #110

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
SuYindu wants to merge 2 commits into
base: master
Choose a base branch
from
Open

修复甲级 1159 题内存泄漏的 bug，并添加甲级 1156 到 1159 题的索引 #110

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
5dc13cb
🐛 bug: fix a bug(memory leak)
May 4, 2019
de57fd0
✏️ docs: update readme(add indices of 1156 to 19)
May 4, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 2 additions & 0 deletions AdvancedLevel_C++/1159. Structure of a Binary Tree (30).cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -76,5 +76,7 @@ int main() {
}
cout << (flag ? "Yes" : "No") << endl;
}
free(postorder);
Copy link

@How-u-doing How-u-doing Jul 3, 2020

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

The resources of tree nodes still not deallocated. Consider std::shared_ptr<TreeNode> instead of raw pointers. Or a tree class with a destructor

Copy link

@How-u-doing How-u-doing Jul 3, 2020

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I wrote an example: Tree.h
Tree_test.cpp.
The allocated memory pointed to by smart pointers won't be deallocated until they reach their lifespan

free(inorder);
return 0;
}
8 changes: 4 additions & 4 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -174,10 +174,10 @@ PAT的这个仓库我一直在维护，包括每次考试后新出的题目都
| 1153 | Decode Registration Card of PAT (25) | [查看题解](https://www.liuchuo.net/archives/8023) | 模拟，排序，map |
| 1154 | Vertex Coloring (25) | [查看题解](https://www.liuchuo.net/archives/8025) | STL的应用，set，hash |
| 1155 | Heap Paths (30) | [查看题解](https://www.liuchuo.net/archives/8027) | 深搜回溯，堆 |
| 1156 | Sexy Primes (20) | [查看题解]() | 水题 |
| 1157 | Anniversary (25) | [查看题解]() | 模拟，set |
| 1158 | Telefraud Detection (25) | [查看题解]() | 模拟，并查集，排序 |
| 1159 | Structure of a Binary Tree (30) | [查看题解]() | 中序后序建树，树的遍历 |
| 1156 | Sexy Primes (20) | [查看题解](./AdvancedLevel_C++/1156.%20Sexy%20Primes%20(20).cpp) | 水题 |
| 1157 | Anniversary (25) | [查看题解](./AdvancedLevel_C++/1157.%20Anniversary%20(25).cpp) | 模拟，set |
| 1158 | Telefraud Detection (25) | [查看题解](./AdvancedLevel_C++/1158.%20Telefraud%20Detection%20(25).cpp) | 模拟，并查集，排序 |
| 1159 | Structure of a Binary Tree (30) | [查看题解](./AdvancedLevel_C++/1159.%20Structure%20of%20a%20Binary%20Tree%20(30).cpp) | 中序后序建树，树的遍历 |

# PAT乙级题解

Expand Down