feat: add js solution to lc problem: No.0198

Author: rain84

solution/0100-0199/0198.House Robber/README.md

@@ -288,6 +288,34 @@ export function rob(nums: number[]): number {
 }
 ```
 
+#### JavaScript
+
+```js
+export function rob(nums) {
+    const cache = {};
+    const n = nums.length;
+    let ans = 0;
+
+    const dp = i => {
+        if (cache[i] !== undefined) return cache[i];
+
+        let max = 0;
+        for (let j = i + 2; j < n; j++) {
+            max = Math.max(max, dp(j));
+        }
+        cache[i] = max + nums[i];
+
+        return cache[i];
+    };
+
+    for (let i = 0; i < n; i++) {
+        ans = Math.max(ans, dp(i));
+    }
+
+    return ans;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0100-0199/0198.House Robber/README_EN.md

@@ -287,6 +287,34 @@ export function rob(nums: number[]): number {
 }
 ```
 
+#### JavaScript
+
+```js
+export function rob(nums) {
+    const cache = {};
+    const n = nums.length;
+    let ans = 0;
+
+    const dp = i => {
+        if (cache[i] !== undefined) return cache[i];
+
+        let max = 0;
+        for (let j = i + 2; j < n; j++) {
+            max = Math.max(max, dp(j));
+        }
+        cache[i] = max + nums[i];
+
+        return cache[i];
+    };
+
+    for (let i = 0; i < n; i++) {
+        ans = Math.max(ans, dp(i));
+    }
+
+    return ans;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0100-0199/0198.House Robber/Solution3.js

@@ -0,0 +1,23 @@
+export function rob(nums) {
+    const cache = {};
+    const n = nums.length;
+    let ans = 0;
+
+    const dp = i => {
+        if (cache[i] !== undefined) return cache[i];
+
+        let max = 0;
+        for (let j = i + 2; j < n; j++) {
+            max = Math.max(max, dp(j));
+        }
+        cache[i] = max + nums[i];
+
+        return cache[i];
+    };
+
+    for (let i = 0; i < n; i++) {
+        ans = Math.max(ans, dp(i));
+    }
+
+    return ans;
+}