朋友们能顺便帮忙看看第二题嘛：实在不知道错哪了，只过了20 func maxHuffman( root *TreeNode ) int { res:=1 var dfs func(*TreeNode)int dfs=func(sub *TreeNode)int{ if sub.Left==nil && sub.Right==nil{ return 1 } left:=0 right:=0 if sub.Left!=nil { left=dfs(sub.Left) } if sub.Right!=nil{ right=dfs(sub.Right) } if left>0 && right>0 && (sub.Left).Val+(sub.Right).Val==sub.Val{ res=max(res,left+right+1) return left+right+1 }else{ return 1 } } dfs(root) return res }