Skip to content
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

Update 0112.路径总和.md #2889

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

Update 0112.路径总和.md #2889

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
fe6ae3c
Update 0112.路径总和.md
WanZhan-lucky Feb 10, 2025
002f9b1
Update 0112.路径总和.md 简化
WanZhan-lucky Feb 10, 2025
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
15 changes: 6 additions & 9 deletions problems/0112.路径总和.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -133,17 +133,14 @@ private:
if (!cur->left && !cur->right && count == 0) return true; // 遇到叶子节点，并且计数为0
if (!cur->left && !cur->right) return false; // 遇到叶子节点直接返回

if (cur->left) { // 左
count -= cur->left->val; // 递归，处理节点;
if (traversal(cur->left, count)) return true;
count += cur->left->val; // 回溯，撤销处理结果
bool leftpath = false, rightpath = false;
if (node->left) {
leftpath = pathSum(node->left, count - node->left->val);
}
if (cur->right) { // 右
count -= cur->right->val; // 递归，处理节点;
if (traversal(cur->right, count)) return true;
count += cur->right->val; // 回溯，撤销处理结果
if (node->right) {
rightpath = pathSum(node->right, count - node->right->val);
}
return false;
return leftpath || rightpath;
}

public:
Expand Down