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};