refactor 1161

fishercoder1534 · fishercoder1534 · commit c0b52abb092d · 2020-08-12T07:28:28.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1161.java b/src/main/java/com/fishercoder/solutions/_1161.java
@@ -6,32 +6,6 @@
 import java.util.Queue;
 import java.util.TreeMap;
 
-/**
- * 1161. Maximum Level Sum of a Binary Tree
- *
- * Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on.
- * Return the smallest level X such that the sum of all the values of nodes at level X is maximal.
- *
- * Example 1:
- *          1
- *         / \
- *        7  0
- *       / \
- *      7  -8
- *
- * Input: [1,7,0,7,-8,null,null]
- * Output: 2
- *
- * Explanation:
- * Level 1 sum = 1.
- * Level 2 sum = 7 + 0 = 7.
- * Level 3 sum = 7 + -8 = -1.
- * So we return the level with the maximum sum which is level 2.
- *
- * Note:
- * The number of nodes in the given tree is between 1 and 10^4.
- * -10^5 <= node.val <= 10^5
- * */
 public class _1161 {
     public static class Solution1 {
         public int maxLevelSum(TreeNode root) {
