add java solution for leetcode 563

Author: Zhanganjin0520

README.md

@@ -74,7 +74,7 @@ LeetCode
 |623|[Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/) | |Medium|
 |581|[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/) | |Easy|
 |572|[Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) | |Easy|
-|563|[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/) | |Easy|
+|563|[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/) | [java](./algorithms/binaryTreeTilt/Solution.java) |Easy|
 |547|[Friend Circles](https://leetcode.com/problems/friend-circles/) | |Medium|
 |543|[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | |Easy|
 |538|[Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/) | |Easy|

algorithms/binaryTreeTilt/Solution.java

@@ -0,0 +1,22 @@
+public class Solution {
+    int tilt = 0;
+
+    public int findTilt(TreeNode root) {
+        if (null == root) {
+            return 0;
+        }
+        iterationNodeTilt(root);
+        return tilt;
+    }
+
+    private int iterationNodeTilt(TreeNode root) {
+        if (null == root) {
+            return 0;
+        }
+        int leftTilt = iterationNodeTilt(root.left);
+        int rightTilt = iterationNodeTilt(root.right);
+
+        tilt += Math.abs(leftTilt - rightTilt);
+        return leftTilt + rightTilt + root.val;
+    }
+}