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

Author: rain84

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

@@ -254,4 +254,42 @@ function rob(nums: number[]): number {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 3: Dynamic Programming, top-down approach
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+export function rob(nums: number[]): number {
+    const cache: Record<number, number> = {};
+    const n = nums.length;
+    let ans = 0;
+
+    const dp = (i: number) => {
+        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 -->
+
 <!-- problem:end -->

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

@@ -253,4 +253,42 @@ function rob(nums: number[]): number {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 3: Dynamic Programming, top-down approach
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+export function rob(nums: number[]): number {
+    const cache: Record<number, number> = {};
+    const n = nums.length;
+    let ans = 0;
+
+    const dp = (i: number) => {
+        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 -->
+
 <!-- problem:end -->

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

@@ -0,0 +1,23 @@
+export function rob(nums: number[]): number {
+    const cache: Record<number, number> = {};
+    const n = nums.length;
+    let ans = 0;
+
+    const dp = (i: number) => {
+        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;
+}