feat: add solutions to lcof problem: No.47

面试题 47. 礼物的最大价值

Author: YangFong

lcof/面试题47. 礼物的最大价值/README.md

@@ -127,6 +127,50 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxValue(grid: number[][]): number {
+    let n = grid.length;
+    let m = grid[0].length;
+    for (let i = 1; i < n; i++) {
+        grid[i][0] += grid[i - 1][0];
+    }
+    for (let i = 1; i < m; i++) {
+        grid[0][i] += grid[0][i - 1];
+    }
+    for (let i = 1; i < n; i++) {
+        for (let j = 1; j < m; j++) {
+            grid[i][j] += Math.max(grid[i][j - 1], grid[i - 1][j]);
+        }
+    }
+    return grid[n - 1][m - 1];
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn max_value(mut grid: Vec<Vec<i32>>) -> i32 {
+        let n = grid.len();
+        let m = grid[0].len();
+        for i in 1..n {
+            grid[i][0] += grid[i - 1][0];
+        }
+        for i in 1..m {
+            grid[0][i] += grid[0][i - 1];
+        }
+        for i in 1..n {
+            for j in 1..m {
+                grid[i][j] += grid[i][j - 1].max(grid[i - 1][j]);
+            }
+        }
+        grid[n - 1][m - 1]
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题47. 礼物的最大价值/Solution.rs

@@ -0,0 +1,18 @@
+impl Solution {
+    pub fn max_value(mut grid: Vec<Vec<i32>>) -> i32 {
+        let n = grid.len();
+        let m = grid[0].len();
+        for i in 1..n {
+            grid[i][0] += grid[i - 1][0];
+        }
+        for i in 1..m {
+            grid[0][i] += grid[0][i - 1];
+        }
+        for i in 1..n {
+            for j in 1..m {
+                grid[i][j] += grid[i][j - 1].max(grid[i - 1][j]);
+            }
+        }
+        grid[n - 1][m - 1]
+    }
+}

lcof/面试题47. 礼物的最大价值/Solution.ts

@@ -0,0 +1,16 @@
+function maxValue(grid: number[][]): number {
+    let n = grid.length;
+    let m = grid[0].length;
+    for (let i = 1; i < n; i++) {
+        grid[i][0] += grid[i - 1][0];
+    }
+    for (let i = 1; i < m; i++) {
+        grid[0][i] += grid[0][i - 1];
+    }
+    for (let i = 1; i < n; i++) {
+        for (let j = 1; j < m; j++) {
+            grid[i][j] += Math.max(grid[i][j - 1], grid[i - 1][j]);
+        }
+    }
+    return grid[n - 1][m - 1];
+}