Aug 4, 2023 · Jul 23, 2023 · Jul 23, 2023 · Jul 23, 2023 · Jul 23, 2023 · Aug 4, 2023
diff --git a/problems/0115.不同的子序列.md b/problems/0115.不同的子序列.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -314,6 +314,63 @@ function numDistinct(s: string, t: string): number {
		};
		```

	### Rust:

	```rust
	impl Solution {
	pub fn num_distinct(s: String, t: String) -> i32 {
	if s.len() < t.len() {
	return 0;
	}
	let mut dp = vec![vec![0; s.len() + 1]; t.len() + 1];
	// i = 0, t 为空字符串,s 作为子序列的个数为 1(删除 s 所有元素)
	dp[0] = vec![1; s.len() + 1];
	for (i, char_t) in t.chars().enumerate() {
	for (j, char_s) in s.chars().enumerate() {
	if char_t == char_s {
	// t 的前 i 个字符在 s 的前 j 个字符中作为子序列的个数
	dp[i + 1][j + 1] = dp[i][j] + dp[i + 1][j];
	continue;
	}
	dp[i + 1][j + 1] = dp[i + 1][j];
	}
	}
	dp[t.len()][s.len()]
	}
	}
	```

	> 滚动数组

	```rust
	impl Solution {
	pub fn num_distinct(s: String, t: String) -> i32 {
	if s.len() < t.len() {
	return 0;
	}
	let (s, t) = (s.into_bytes(), t.into_bytes());
	// 对于 t 为空字符串,s 作为子序列的个数为 1(删除 s 所有元素)
	let mut dp = vec![1; s.len() + 1];
	for char_t in t {
	// dp[i - 1][j - 1],dp[j + 1] 更新之前的值
	let mut pre = dp[0];
	// 当开始遍历 t,s 的前 0 个字符无法包含任意子序列
	dp[0] = 0;
	for (j, &char_s) in s.iter().enumerate() {
	let temp = dp[j + 1];
	if char_t == char_s {
	dp[j + 1] = pre + dp[j];
	} else {
	dp[j + 1] = dp[j];
	}
	pre = temp;
	}
	}
	dp[s.len()]
	}
	}
	```


		<p align="center">
		<a href="https://programmercarl.com/other/kstar.html" target="_blank">
Expand Down