From 04d18654c546449e116f9f7e1cef4d60b899cf8e Mon Sep 17 00:00:00 2001 From: Merlin218 <61051874+Merlin218@users.noreply.github.com> Date: Thu, 4 Aug 2022 15:48:24 +0800 Subject: [PATCH] =?UTF-8?q?fix(0337.=E6=89=93=E5=AE=B6=E5=8A=AB=E8=88=8D):?= =?UTF-8?q?=20=E4=BF=AE=E5=A4=8D=E4=BB=A3=E7=A0=81=E4=B8=AD=E9=94=99?= =?UTF-8?q?=E8=AF=AF?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- problems/0337.打家劫舍III.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/problems/0337.打家劫舍III.md b/problems/0337.打家劫舍III.md index d2add232..1f6fdbc8 100644 --- a/problems/0337.打家劫舍III.md +++ b/problems/0337.打家劫舍III.md @@ -190,9 +190,9 @@ public: if (cur == NULL) return vector{0, 0}; vector left = robTree(cur->left); vector right = robTree(cur->right); - // 偷cur - int val1 = cur->val + left[0] + right[0]; - // 不偷cur + // 偷cur，那么就不能偷左右节点。 + int val1 = cur->val + left[1] + right[1]; + // 不偷cur，那么可以偷也可以不偷左右节点，则取较大的情况 int val2 = max(left[0], left[1]) + max(right[0], right[1]); return {val2, val1}; }