add some new solution for 563

Author: 0xff-dev

leetcode/501-600/0563.Binary-Tree-Tilt/README.md

@@ -1,28 +1,45 @@
 # [563.Binary Tree Tilt][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
+Given the `root` of a binary tree, return the sum of every tree node's __tilt__.
 
-**Example 1:**
+The __tilt__ of a tree node is the __absolute difference__ between the sum of all left subtree node __values__ and all right subtree node __values__. If a node does not have a left child, then the sum of the left subtree node __values__ is treated as `0`. The rule is similar if there the node does not have a right child.
 
-```
-Input: a = "11", b = "1"
-Output: "100"
-```
 
-## 题意
-> ...
+**Example 1:** 
+![tilt1](./tilt1.jpeg)
 
-## 题解
+```
+Input: root = [1,2,3]
+Output: 1
+Explanation: 
+Tilt of node 2 : |0-0| = 0 (no children)
+Tilt of node 3 : |0-0| = 0 (no children)
+Tilt of node 1 : |2-3| = 1 (left subtree is just left child, so sum is 2; right subtree is just right child, so sum is 3)
+Sum of every tilt : 0 + 0 + 1 = 1
+```
 
-### 思路1
-> ...
-Binary Tree Tilt
-```go
+**Example 2:** 
+![tilt2](./tilt2.jpeg)
+```
+Input: root = [4,2,9,3,5,null,7]
+Output: 15
+Explanation: 
+Tilt of node 3 : |0-0| = 0 (no children)
+Tilt of node 5 : |0-0| = 0 (no children)
+Tilt of node 7 : |0-0| = 0 (no children)
+Tilt of node 2 : |3-5| = 2 (left subtree is just left child, so sum is 3; right subtree is just right child, so sum is 5)
+Tilt of node 9 : |0-7| = 7 (no left child, so sum is 0; right subtree is just right child, so sum is 7)
+Tilt of node 4 : |(3+5+2)-(9+7)| = |10-16| = 6 (left subtree values are 3, 5, and 2, which sums to 10; right subtree values are 9 and 7, which sums to 16)
+Sum of every tilt : 0 + 0 + 0 + 2 + 7 + 6 = 15
 ```
 
+**Example 3:** 
+![tilt3](./tilt3.jpeg)
+```
+Input: root = [21,7,14,1,1,2,2,3,3]
+Output: 9
+```
 
 ## 结语
 

leetcode/501-600/0563.Binary-Tree-Tilt/Solution.go

@@ -1,5 +1,22 @@
 package Solution
 
-func Solution(x bool) bool {
-return x
+func findTiltAux(root *TreeNode, tilt *int) int {
+if root == nil {
+return 0
+}
+
+left := findTiltAux(root.Left, tilt)
+right := findTiltAux(root.Right, tilt)
+abs := left - right
+if abs < 0 {
+abs = -abs
+}
+*tilt += abs
+return left + right + root.Val
+}
+
+func Solution(root *TreeNode) int {
+tilt := 0
+_ = findTiltAux(root, &tilt)
+return tilt
 }

leetcode/501-600/0563.Binary-Tree-Tilt/Solution_test.go

@@ -10,12 +10,63 @@ func TestSolution(t *testing.T) {
 //	测试用例
 cases := []struct {
 name string
-inputs bool
-expect bool
+inputs *TreeNode
+expect int
 }{
-{"TestCase", true, true},
-{"TestCase", true, true},
-{"TestCase", false, false},
+{"TestCase1", &TreeNode{
+Val: 1,
+Left: &TreeNode{
+Val: 2,
+},
+Right: &TreeNode{
+Val: 3,
+},
+}, 1},
+{"TestCase", &TreeNode{
+Val: 4,
+Left: &TreeNode{
+Val: 2,
+Left: &TreeNode{
+Val: 3,
+},
+Right: &TreeNode{
+Val: 5,
+},
+},
+Right: &TreeNode{
+Val: 9,
+Right: &TreeNode{
+Val: 7,
+},
+},
+}, 15},
+{"TestCase", &TreeNode{
+Val: 21,
+Left: &TreeNode{
+Val: 7,
+Left: &TreeNode{
+Val: 1,
+Left: &TreeNode{
+Val: 3,
+},
+Right: &TreeNode{
+Val: 3,
+},
+},
+Right: &TreeNode{
+Val: 1,
+},
+},
+Right: &TreeNode{
+Val: 14,
+Left: &TreeNode{
+Val: 2,
+},
+Right: &TreeNode{
+Val: 2,
+},
+},
+}, 9},
 }
 
 //	开始测试

leetcode/501-600/0563.Binary-Tree-Tilt/tilt1.jpeg

@@ -0,0 +1,7 @@
+package Solution
+
+type TreeNode struct {
+Val int
+Left *TreeNode
+Right *TreeNode
+}