algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-06 15:09:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

0337.打家劫舍III.md 使用 slices.Max 替代手工max func。

Browse Source
This commit is contained in:
Lane Zhang
2024-11-22 10:59:16 +08:00
parent 5e0ab49475
commit e40ddd5cbf
1 changed files with 2 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
problems/0337.打家劫舍III.md
View File

@ -477,14 +477,7 @@ func max(x, y int) int {
```go ```go
func rob(root *TreeNode) int { func rob(root *TreeNode) int {
res := robTree(root) res := robTree(root)
return max(res[0], res[1]) return slices.Max(res)
}
func max(a, b int) int {
if a > b {
return a
}
return b
} }
func robTree(cur *TreeNode) []int { func robTree(cur *TreeNode) []int {
@ -498,7 +491,7 @@ func robTree(cur *TreeNode) []int {
// 考虑去偷当前的屋子 // 考虑去偷当前的屋子
robCur := cur.Val + left[0] + right[0] 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:去偷 // 注意顺序：0:不偷，1:去偷
return []int{notRobCur, robCur} return []int{notRobCur, robCur}