代码随想录打卡 Day17

最新推荐文章于 2024-07-24 08:30:00 发布

不见星河路

最新推荐文章于 2024-07-24 08:30:00 发布

阅读量114

点赞数

文章标签： c++ 算法数据结构

本文链接：https://blog.csdn.net/qq_43593188/article/details/129374153

版权

110.平衡二叉树

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func isBalanced(root *TreeNode) bool {
    res := getHight(root)
    if res == -1{
        return false
    }
    return true
}

func getHight(root *TreeNode) int {
    if root == nil{
        return 0
    }
    l , r := getHight(root.Left) , getHight(root.Right)
    if(l == -1 || r == -1){
        return -1 
    }
    if(l - r > 1 || r - l > 1){
        return -1
    }
    return max(l , r) + 1
}

func max(a int, b int) int {
    if a > b{
        return a
    }
    return b
}

257. 二叉树的所有路径

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func binaryTreePaths(root *TreeNode) []string {
    var res []string
    if root == nil{
        return res
    }

    var backAl func(root *TreeNode , s string)
    backAl = func(root *TreeNode , s string){
        if root.Right == nil && root.Left == nil{
            a := s + strconv.Itoa(root.Val)
            res = append(res , a)
            return
        }
        s = s + strconv.Itoa(root.Val) + "->"
        if root.Left != nil{
            backAl(root.Left , s)
        }
        if root.Right != nil{
            backAl(root.Right , s)
        }
    }
    backAl(root,"")
    return res
}

404.左叶子之和

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func sumOfLeftLeaves(root *TreeNode) int {
    sum := 0
    if root == nil{
        return sum
    }
    var backAl func(root *TreeNode) 
    backAl = func(root *TreeNode) {
         if (root.Left == nil && root.Right == nil){
             return
         }
        if(root.Left != nil && root.Left.Left == nil && root.Left.Right == nil){
            sum = sum + root.Left.Val
        }
        if root.Left != nil{
            backAl(root.Left)
        }
        if root.Right != nil{
            backAl(root.Right)
        }
    }
    backAl(root)
    return sum
}