refactor 617

fishercoder1534 · fishercoder1534 · commit 8c44c2ae0eca · 2020-07-17T07:09:31.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_617.java b/src/main/java/com/fishercoder/solutions/_617.java
@@ -2,33 +2,6 @@
 
 import com.fishercoder.common.classes.TreeNode;
 
-/**
- * 617. Merge Two Binary Trees
- *
- * Given two binary trees and imagine that when you put one of them to cover the other,
- * some nodes of the two trees are overlapped while the others are not.
- You need to merge them into a new binary tree.
- The merge rule is that if two nodes overlap,
- then sum node values up as the new value of the merged node.
- Otherwise, the NOT null node will be used as the node of new tree.
-
- Example 1:
- Input:
- Tree 1                     Tree 2
-    1                         2
-   / \                       / \
-  3   2                     1   3
- /                           \   \
-5                             4   7
- Output:
- Merged tree:
-     3
-    / \
-   4   5
-  / \   \
- 5   4   7
- Note: The merging process must start from the root nodes of both trees.
- */
 public class _617 {
 
     public static class Solution1 {
