feat: add rust solution to lc problem: No.1458 (#1775)

Author: xzhseh

solution/1400-1499/1458.Max Dot Product of Two Subsequences/README.md

@@ -139,6 +139,31 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    #[allow(dead_code)]
+    pub fn max_dot_product(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
+        let n = nums1.len();
+        let m = nums2.len();
+        let mut dp = vec![vec![i32::MIN; m + 1]; n + 1];
+
+        // Begin the actual dp process
+        for i in 1..=n {
+            for j in 1..=m {
+                dp[i][j] = std::cmp::max(
+                    std::cmp::max(dp[i - 1][j], dp[i][j - 1]),
+                    std::cmp::max(dp[i - 1][j - 1], 0) + nums1[i - 1] * nums2[j - 1],
+                );
+            }
+        }
+
+        dp[n][m]
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/1400-1499/1458.Max Dot Product of Two Subsequences/README_EN.md

@@ -105,6 +105,31 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    #[allow(dead_code)]
+    pub fn max_dot_product(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
+        let n = nums1.len();
+        let m = nums2.len();
+        let mut dp = vec![vec![i32::MIN; m + 1]; n + 1];
+
+        // Begin the actual dp process
+        for i in 1..=n {
+            for j in 1..=m {
+                dp[i][j] = std::cmp::max(
+                    std::cmp::max(dp[i - 1][j], dp[i][j - 1]),
+                    std::cmp::max(dp[i - 1][j - 1], 0) + nums1[i - 1] * nums2[j - 1],
+                );
+            }
+        }
+
+        dp[n][m]
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/1400-1499/1458.Max Dot Product of Two Subsequences/Solution.rs

@@ -0,0 +1,20 @@
+impl Solution {
+    #[allow(dead_code)]
+    pub fn max_dot_product(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
+        let n = nums1.len();
+        let m = nums2.len();
+        let mut dp = vec![vec![i32::MIN; m + 1]; n + 1];
+
+        // Begin the actual dp process
+        for i in 1..=n {
+            for j in 1..=m {
+                dp[i][j] = std::cmp::max(
+                    std::cmp::max(dp[i - 1][j], dp[i][j - 1]),
+                    std::cmp::max(dp[i - 1][j - 1], 0) + nums1[i - 1] * nums2[j - 1],
+                );
+            }
+        }
+
+        dp[n][m]
+    }
+}