algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 19:44:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix(0337.打家劫舍): 修复代码中错误

Browse Source
This commit is contained in:
Merlin218
2022-08-04 15:48:24 +08:00
committed by GitHub
parent 984576943a
commit 04d18654c5
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0337.打家劫舍III.md
View File

@ -190,9 +190,9 @@ public:
if (cur == NULL) return vector<int>{0, 0}; if (cur == NULL) return vector<int>{0, 0};
vector<int> left = robTree(cur->left); vector<int> left = robTree(cur->left);
vector<int> right = robTree(cur->right); vector<int> right = robTree(cur->right);
// 偷cur // 偷cur，那么就不能偷左右节点。
int val1 = cur->val + left[0] + right[0]; int val1 = cur->val + left[1] + right[1];
// 不偷cur // 不偷cur，那么可以偷也可以不偷左右节点，则取较大的情况
int val2 = max(left[0], left[1]) + max(right[0], right[1]); int val2 = max(left[0], left[1]) + max(right[0], right[1]);
return {val2, val1}; return {val2, val1};
} }