feat: add rust solution to lc problem: No.0096 (#1726)

No.0096.Unique Binary Search Trees

Author: poltao

solution/0000-0099/0096.Unique Binary Search Trees/README.md

@@ -107,6 +107,24 @@ func numTrees(n int) int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn num_trees(n: i32) -> i32 {
+        let n = n as usize;
+        let mut dp = vec![0; n + 1];
+        dp[0] = 1;
+        for i in 1..=n {
+            for j in 0..i {
+                dp[i] += dp[j] * dp[i - j - 1];
+            }
+        }
+        dp[n] as i32
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0096.Unique Binary Search Trees/README_EN.md

@@ -95,6 +95,24 @@ func numTrees(n int) int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn num_trees(n: i32) -> i32 {
+        let n = n as usize;
+        let mut dp = vec![0; n + 1];
+        dp[0] = 1;
+        for i in 1..=n {
+            for j in 0..i {
+                dp[i] += dp[j] * dp[i - j - 1];
+            }
+        }
+        dp[n] as i32
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0096.Unique Binary Search Trees/Solution.rs

@@ -0,0 +1,13 @@
+impl Solution {
+    pub fn num_trees(n: i32) -> i32 {
+        let n = n as usize;
+        let mut dp = vec![0; n + 1];
+        dp[0] = 1;
+        for i in 1..=n {
+            for j in 0..i {
+                dp[i] += dp[j] * dp[i - j - 1];
+            }
+        }
+        dp[n] as i32
+    }
+}