refactor 508

fishercoder1534 · fishercoder1534 · commit 9c91b173c0fe · 2020-07-15T09:02:18.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_508.java b/src/main/java/com/fishercoder/solutions/_508.java
@@ -9,30 +9,6 @@
 import java.util.List;
 import java.util.Map;
 
-/**
- * 508. Most Frequent Subtree Sum
- *
- * Given the root of a tree, you are asked to find the most frequent subtree sum.
- * The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (including the node itself).
- * So what is the most frequent subtree sum value? If there is a tie, return all the values with the highest frequency in any order.
-
- Examples 1
- Input:
-    5
-  /  \
- 2   -3
- return [2, -3, 4], since all the values happen only once, return all of them in any order.
-
- Examples 2
- Input:
-
-    5
-  /  \
- 2   -5
- return [2], since 2 happens twice, however -5 only occur once.
-
- Note: You may assume the sum of values in any subtree is in the range of 32-bit signed integer.
- */
 public class _508 {
 
     public static class Solution1 {
