From e40ddd5cbf46ae62a0b1aee4b683fb899b6fd6c8 Mon Sep 17 00:00:00 2001
From: Lane Zhang <zjloveztt@gmail.com>
Date: Fri, 22 Nov 2024 10:59:16 +0800
Subject: [PATCH] =?UTF-8?q?0337.=E6=89=93=E5=AE=B6=E5=8A=AB=E8=88=8DIII.md?=
 =?UTF-8?q?=20=E4=BD=BF=E7=94=A8=20`slices.Max`=20=E6=9B=BF=E4=BB=A3?=
 =?UTF-8?q?=E6=89=8B=E5=B7=A5max=20func=E3=80=82?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0337.打家劫舍III.md b/problems/0337.打家劫舍III.md
index 12e31aba..a3130df7 100644
--- a/problems/0337.打家劫舍III.md
+++ b/problems/0337.打家劫舍III.md
@@ -477,14 +477,7 @@ func max(x, y int) int {
 ```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
+	return slices.Max(res)
 }
 
 func robTree(cur *TreeNode) []int {
@@ -498,7 +491,7 @@ func robTree(cur *TreeNode) []int {
     // 考虑去偷当前的屋子
 	robCur := cur.Val + left[0] + right[0]
     // 考虑不去偷当前的屋子
-	notRobCur := max(left[0], left[1]) + max(right[0], right[1])
+	notRobCur := slices.Max(left) + slices.Max(right)
 
     // 注意顺序：0:不偷，1:去偷
 	return []int{notRobCur, robCur}