refactor 979

fishercoder1534 · fishercoder1534 · commit a0d45488aa6e · 2020-08-03T15:52:49.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_979.java b/src/main/java/com/fishercoder/solutions/_979.java
@@ -2,61 +2,11 @@
 
 import com.fishercoder.common.classes.TreeNode;
 
-/**
- * 979. Distribute Coins in Binary Tree
- *
- * Given the root of a binary tree with N nodes, each node in the tree has node.val coins, and there are N coins total.
- * In one move, we may choose two adjacent nodes and move one coin from one node to another.  (The move may be from parent to child, or from child to parent.)
- * Return the number of moves required to make every node have exactly one coin.
- *
- * Example 1:
- *
- *      3
- *     / \
- *    0  0
- *
- * Input: [3,0,0]
- * Output: 2
- * Explanation: From the root of the tree, we move one coin to its left child, and one coin to its right child.
- *
- * Example 2:
- *
- *    0
- *   / \
- *  3  0
- *
- * Input: [0,3,0]
- * Output: 3
- * Explanation: From the left child of the root, we move two coins to the root [taking two moves].  Then, we move one coin from the root of the tree to the right child.
- *
- * Example 3:
- *
- *    0
- *   / \
- *  1  2
- *
- * Input: [1,0,2]
- * Output: 2
- *
- * Example 4:
- *
- *     1
- *    / \
- *   0  0
- *    \
- *    3
- *
- * Input: [1,0,0,null,3]
- * Output: 4
- *
- *
- * Note:
- * 1<= N <= 100
- * 0 <= node.val <= N
- * */
 public class _979 {
     public static class Solution1 {
-        /**credit: https://leetcode.com/problems/distribute-coins-in-binary-tree/discuss/221930/JavaC%2B%2BPython-Recursive-Solution*/
+        /**
+         * credit: https://leetcode.com/problems/distribute-coins-in-binary-tree/discuss/221930/JavaC%2B%2BPython-Recursive-Solution
+         */
         int moves = 0;
 
         public int distributeCoins(TreeNode root) {
