refactor 1022

fishercoder1534 · fishercoder1534 · commit d7d122e88765 · 2020-08-06T15:25:17.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1022.java b/src/main/java/com/fishercoder/solutions/_1022.java
@@ -5,35 +5,6 @@
 import java.util.ArrayList;
 import java.util.List;
 
-/**
- * Source: https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/
- *
- * 1022. Sum of Root To Leaf Binary Numbers
- *
- * Given a binary tree, each node has value 0 or 1.  Each root-to-leaf path represents a binary number starting with the most significant bit.  For example, if the path is 0 -> 1 -> 1 -> 0 -> 1, then this could represent 01101 in binary, which is 13.
- *
- * For all leaves in the tree, consider the numbers represented by the path from the root to that leaf.
- *
- * Return the sum of these numbers.
- *
- * Example 1:
- *
- *        1
- *       / \
- *      0   1
- *     / \ / \
- *    0  1 0 1
- *
- * Input: [1,0,1,0,1,0,1]
- * Output: 22
- * Explanation: (100) + (101) + (110) + (111) = 4 + 5 + 6 + 7 = 22
- *
- * Note:
- *
- * The number of nodes in the tree is between 1 and 1000.
- * node.val is 0 or 1.
- * The answer will not exceed 2^31 - 1.
- * */
 public class _1022 {
     public static class Solution1 {
         public int sumRootToLeaf(TreeNode root) {
