From 2ffce0512f3342602d9e1b084553848e67797bf1 Mon Sep 17 00:00:00 2001
From: GY-code <gu_yi163@163.com>
Date: Thu, 1 Sep 2022 21:07:04 +0800
Subject: [PATCH] =?UTF-8?q?Update=200337.=E6=89=93=E5=AE=B6=E5=8A=AB?=
 =?UTF-8?q?=E8=88=8DIII.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

代码问题，对偷家情况，上面分述部分正确，下面综合代码，对应孩子下标应该为0，即`int val1 = cur->val + left[0] + right[0];`
---
 problems/0337.打家劫舍III.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/problems/0337.打家劫舍III.md b/problems/0337.打家劫舍III.md
index 20b458e9..295f19fe 100644
--- a/problems/0337.打家劫舍III.md
+++ b/problems/0337.打家劫舍III.md
@@ -191,7 +191,7 @@ public:
         vector<int> left = robTree(cur->left);
         vector<int> right = robTree(cur->right);
         // 偷cur，那么就不能偷左右节点。
-        int val1 = cur->val + left[1] + right[1];
+        int val1 = cur->val + left[0] + right[0];
         // 不偷cur，那么可以偷也可以不偷左右节点，则取较大的情况
         int val2 = max(left[0], left[1]) + max(right[0], right[1]);
         return {val2, val1};