refactor 337

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_337.java

@@ -5,33 +5,6 @@
 import java.util.HashMap;
 import java.util.Map;
 
-/**337. House Robber III
-
- The thief has found himself a new place for his thievery again.
- There is only one entrance to this area, called the "root."
- Besides the root, each house has one and only one parent house.
- After a tour, the smart thief realized that "all houses in this place forms a binary tree".
- It will automatically contact the police if two directly-linked houses were broken into on the same night.
-
-Determine the maximum amount of money the thief can rob tonight without alerting the police.
-
-Example 1:
-     3
-    / \
-   2   3
-    \   \
-     3   1
-Maximum amount of money the thief can rob = 3 + 3 + 1 = 7.
-
-Example 2:
-     3
-    / \
-   4   5
-  / \   \
- 1   3   1
-Maximum amount of money the thief can rob = 4 + 5 = 9.
-*/
-
 public class _337 {
 
     public static class Solution1 {
@@ -76,7 +49,7 @@ private int getMaxValue(TreeNode root, Map<TreeNode, Integer> map) {
                 val += getMaxValue(root.right.left, map) + getMaxValue(root.right.right, map);
             }
             int max = Math.max(root.val + val,
-                getMaxValue(root.left, map) + getMaxValue(root.right, map));
+                    getMaxValue(root.left, map) + getMaxValue(root.right, map));
             map.put(root, max);
             return max;
         }