From b64e34815dc60ba7b0a2450a7bcf7cd723ec0abc Mon Sep 17 00:00:00 2001
From: Henry Du <henrydu.com@gmail.com>
Date: Tue, 12 Oct 2021 18:27:06 -0700
Subject: [PATCH] =?UTF-8?q?Add=20Go=20into=20337.=E6=89=93=E5=AE=B6?=
 =?UTF-8?q?=E5=8A=AB=E8=88=8DIII.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0337.打家劫舍III.md | 35 ++++++++++++++++++++++++++++++++
 1 file changed, 35 insertions(+)

diff --git a/problems/0337.打家劫舍III.md b/problems/0337.打家劫舍III.md
index 949137c3..8456adf1 100644
--- a/problems/0337.打家劫舍III.md
+++ b/problems/0337.打家劫舍III.md
@@ -368,6 +368,41 @@ class Solution:
         return (val1, val2)
 ```
 
+Go:
+
+> 动态规划
+
+```go
+func rob(root *TreeNode) int {
+	res := robTree(root)
+	return max(res[0], res[1])
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func robTree(cur *TreeNode) []int {
+	if cur == nil {
+		return []int{0, 0}
+	}
+	// 后序遍历
+	left := robTree(cur.Left)
+	right := robTree(cur.Right)
+
+    // 考虑去偷当前的屋子
+	robCur := cur.Val + left[0] + right[0]
+    // 考虑不去偷当前的屋子
+	notRobCur := max(left[0], left[1]) + max(right[0], right[1])
+
+    // 注意顺序：0:不偷，1:去偷
+	return []int{notRobCur, robCur}
+}
+```
+
 JavaScript：
 
 > 动态规划