update 337

Author: fishercoder1534

Diff for: src/main/java/com/fishercoder/solutions/_337.java

@@ -6,9 +6,8 @@
 import java.util.Map;
 
 public class _337 {
-
     public static class Solution1 {
-        //simple recursion without cacheing: 1189 ms
+        //simple recursion without caching: 1189 ms
         public int rob(TreeNode root) {
             if (root == null) {
                 return 0;
@@ -27,8 +26,8 @@ public int rob(TreeNode root) {
     }
 
     public static class Solution2 {
-        //same idea, but with cacheing via a hashmap: 8 ms
-        public int rob_dp(TreeNode root) {
+        //same idea, but with caching via a hashmap: 8 ms
+        public int rob(TreeNode root) {
             Map<TreeNode, Integer> map = new HashMap<>();
             return getMaxValue(root, map);
         }

Diff for: src/test/java/com/fishercoder/_337Test.java

@@ -0,0 +1,28 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.TreeUtils;
+import com.fishercoder.solutions._337;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import java.util.Arrays;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _337Test {
+    private static _337.Solution1 solution1;
+    private static _337.Solution2 solution2;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _337.Solution1();
+        solution2 = new _337.Solution2();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(7, solution1.rob(TreeUtils.constructBinaryTree(Arrays.asList(3, 2, 3, null, 3, null, 1))));
+        assertEquals(7, solution2.rob(TreeUtils.constructBinaryTree(Arrays.asList(3, 2, 3, null, 3, null, 1))));
+    }
+
+}