swift递归检测对称二叉树
文章目录
var isS: Bool = true
func isSymmetric(_ root: TreeNode?) -> Bool {
helper(root, root)
return isS
}
func helper(_ left: TreeNode?, _ right: TreeNode?) {
if isS == false {
return
}
if left == nil {
isS = right == nil
return
}
if right == nil {
isS = left == nil
return
}
if left!.val != right!.val {
isS = false
return
}
let nodei = left?.left
let nodej = left?.right
let nodex = right?.left
let nodey = right?.right
helper(nodei, nodey)
helper(nodej, nodex)
}
评论
登录后参与技术讨论,分享你的经验与见解。
登录 / 注册暂无评论