feat: add solutions to lc problem: No.0198

No.0198.House Robber

Author: YangFong

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

@@ -116,6 +116,32 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function rob(nums: number[]): number {
+    const dp = [0, 0];
+    for (const num of nums) {
+        [dp[0], dp[1]] = [dp[1], Math.max(dp[1], dp[0] + num)];
+    }
+    return dp[1];
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn rob(nums: Vec<i32>) -> i32 {
+        let mut dp = [0, 0];
+        for num in nums {
+            dp = [dp[1], dp[1].max(dp[0] + num)]
+        }
+        dp[1]
+    }
+}
+```
+
 ### **...**
 
 ```

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

@@ -103,6 +103,32 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function rob(nums: number[]): number {
+    const dp = [0, 0];
+    for (const num of nums) {
+        [dp[0], dp[1]] = [dp[1], Math.max(dp[1], dp[0] + num)];
+    }
+    return dp[1];
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn rob(nums: Vec<i32>) -> i32 {
+        let mut dp = [0, 0];
+        for num in nums {
+            dp = [dp[1], dp[1].max(dp[0] + num)]
+        }
+        dp[1]
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0198.House Robber/Solution.rs

@@ -0,0 +1,9 @@
+impl Solution {
+    pub fn rob(nums: Vec<i32>) -> i32 {
+        let mut dp = [0, 0];
+        for num in nums {
+            dp = [dp[1], dp[1].max(dp[0] + num)]
+        }
+        dp[1]
+    }
+}

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

@@ -0,0 +1,7 @@
+function rob(nums: number[]): number {
+    const dp = [0, 0];
+    for (const num of nums) {
+        [dp[0], dp[1]] = [dp[1], Math.max(dp[1], dp[0] + num)];
+    }
+    return dp[1];
+}