feat: add rust solution to lc problem: No.0064

- No.0064.Minimum Path Sum

Author: YangFong

solution/0000-0099/0064.Minimum Path Sum/README.md

@@ -233,6 +233,29 @@ var minPathSum = function (grid) {
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn min_path_sum(mut grid: Vec<Vec<i32>>) -> i32 {
+        let m = grid.len();
+        let n = grid[0].len();
+        for i in 1..m {
+            grid[i][0] += grid[i - 1][0];
+        }
+        for i in 1..n {
+            grid[0][i] += grid[0][i - 1];
+        }
+        for i in 1..m {
+            for j in 1..n {
+                grid[i][j] += grid[i][j - 1].min(grid[i - 1][j]);
+            }
+        }
+        grid[m - 1][n - 1]
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0064.Minimum Path Sum/README_EN.md

@@ -219,6 +219,29 @@ var minPathSum = function (grid) {
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn min_path_sum(mut grid: Vec<Vec<i32>>) -> i32 {
+        let m = grid.len();
+        let n = grid[0].len();
+        for i in 1..m {
+            grid[i][0] += grid[i - 1][0];
+        }
+        for i in 1..n {
+            grid[0][i] += grid[0][i - 1];
+        }
+        for i in 1..m {
+            for j in 1..n {
+                grid[i][j] += grid[i][j - 1].min(grid[i - 1][j]);
+            }
+        }
+        grid[m - 1][n - 1]
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0064.Minimum Path Sum/Solution.rs

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