[Swift]LeetCode563. 二叉树的坡度 | Binary Tree Tilt

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/9842592.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

Given a binary tree, return the tilt of the whole tree.

The tilt of a tree node is defined as the absolute difference between the sum of all left subtree node values and the sum of all right subtree node values. Null node has tilt 0.

The tilt of the whole tree is defined as the sum of all nodes' tilt.

Example:

Input: 
         1
       /   
      2     3
Output: 1
Explanation: 
Tilt of node 2 : 0
Tilt of node 3 : 0
Tilt of node 1 : |2-3| = 1
Tilt of binary tree : 0 + 0 + 1 = 1

 Note:

1. The sum of node values in any subtree won't exceed the range of 32-bit integer.
2. All the tilt values won't exceed the range of 32-bit integer.

---

给定一个二叉树，计算整个树的坡度。

一个树的节点的坡度定义即为，该节点左子树的结点之和和右子树结点之和的差的绝对值。空结点的的坡度是0。

整个树的坡度就是其所有节点的坡度之和。

示例:

输入: 
         1
       /   
      2     3
输出: 1
解释: 
结点的坡度 2 : 0
结点的坡度 3 : 0
结点的坡度 1 : |2-3| = 1
树的坡度 : 0 + 0 + 1 = 1

注意:

1. 任何子树的结点的和不会超过32位整数的范围。
2. 坡度的值不会超过32位整数的范围。

---

44ms

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public var val: Int
 *     public var left: TreeNode?
 *     public var right: TreeNode?
 *     public init(_ val: Int) {
 *         self.val = val
 *         self.left = nil
 *         self.right = nil
 *     }
 * }
 */
class Solution {
    func findTilt(_ root: TreeNode?) -> Int {
        var sum = 0
        
        func getAllTilts(_ root: TreeNode?) -> Int {
            guard let root = root else { return 0 }
            var lVal = 0
            var rVal = 0
            if root.left != nil {
                lVal = getAllTilts(root.left)
            }
            if root.right != nil {
                rVal = getAllTilts(root.right)
            }
            sum += abs(lVal - rVal)
            return lVal + rVal + root.val
        }
        
        getAllTilts(root)
        return sum
    }
}

---

48ms

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public var val: Int
 *     public var left: TreeNode?
 *     public var right: TreeNode?
 *     public init(_ val: Int) {
 *         self.val = val
 *         self.left = nil
 *         self.right = nil
 *     }
 * }
 */
class Solution {
    var tilt = 0
    
    func findTilt(_ root: TreeNode?) -> Int {
        aux(root)
        return tilt
    }
    func aux(_ root:TreeNode?) -> Int {
        if root == nil {
            return 0 
        }
        let tiltLeft = aux(root?.left)
        let tiltRight = aux(root?.right)
        
        tilt += abs(tiltLeft - tiltRight) 
        
        return tiltLeft + tiltRight + root!.val
    }
}

---

68ms

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public var val: Int
 *     public var left: TreeNode?
 *     public var right: TreeNode?
 *     public init(_ val: Int) {
 *         self.val = val
 *         self.left = nil
 *         self.right = nil
 *     }
 * }
 */
class Solution {
    var tilt = 0
    
    func findTilt(_ root: TreeNode?) -> Int {
        traverse(root)
        return tilt
    }
    
    func traverse(_ root: TreeNode?) -> Int {
        guard let root = root else { return 0 }
        
        let l = traverse(root.left)
        let r = traverse(root.right)
        
        tilt += abs(l - r)
        
        return l + r + root.val
    }
}

---

88ms

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public var val: Int
 *     public var left: TreeNode?
 *     public var right: TreeNode?
 *     public init(_ val: Int) {
 *         self.val = val
 *         self.left = nil
 *         self.right = nil
 *     }
 * }
 */
class Solution {
    var tilt = 0
    func findTilt(_ root: TreeNode?) -> Int {
                
        helper(root)       
        return  tilt
    }
    
    func helper(_ root: TreeNode?) -> Int {
        guard let root = root else {
            return 0
        }
        
        let left = helper(root.left)
        let right = helper(root.right)
        tilt +=  abs(left - right)
        
        return root.val + left + right
    }
}

---

92ms

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public var val: Int
 *     public var left: TreeNode?
 *     public var right: TreeNode?
 *     public init(_ val: Int) {
 *         self.val = val
 *         self.left = nil
 *         self.right = nil
 *     }
 * }
 */
class Solution {
    
    var sum = 0

func findTilt(_ root: TreeNode?) -> Int {
        traverse(root)
        return sum
    }
    
    func traverse(_ root: TreeNode?) -> Int {
        guard let root = root else {
            return 0
        }
        var left = traverse(root.left)
        var val = root.val
        let right = traverse(root.right)
        sum += Int(abs(left - right))
        return left + right + val
    }
}

---

128ms

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public var val: Int
 *     public var left: TreeNode?
 *     public var right: TreeNode?
 *     public init(_ val: Int) {
 *         self.val = val
 *         self.left = nil
 *         self.right = nil
 *     }
 * }
 */
class Solution {
    
    var sum = 0

func findTilt(_ root: TreeNode?) -> Int {
        traverse(root)
        return sum
    }
    
    func traverse(_ root: TreeNode?) -> Int {
        guard let root = root else {
            return 0
        }
        var left = traverse(root.left)
        var val = root.val
        let right = traverse(root.right)
        if (val == 1) {
            print(left)
            print(abs(left - right))
        }
        sum += Int(abs(left - right))
        if (val == 2) {
            print(left + right + val)
        }
        return left + right + val
    }
}