We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents b65d1f8 + 4822d8f commit 3387793Copy full SHA for 3387793
problems/0516.最长回文子序列.md
@@ -272,7 +272,26 @@ function longestPalindromeSubseq(s: string): number {
272
};
273
```
274
275
-
+Rust:
276
+
277
+```rust
278
+impl Solution {
279
+ pub fn longest_palindrome_subseq(s: String) -> i32 {
280
+ let mut dp = vec![vec![0; s.len()]; s.len()];
281
+ for i in (0..s.len()).rev() {
282
+ dp[i][i] = 1;
283
+ for j in i + 1..s.len() {
284
+ if s[i..=i] == s[j..=j] {
285
+ dp[i][j] = dp[i + 1][j - 1] + 2;
286
+ continue;
287
+ }
288
+ dp[i][j] = dp[i + 1][j].max(dp[i][j - 1]);
289
290
291
+ dp[0][s.len() - 1]
292
293
+}
294
+```
295
296
297
<p align="center">
0 commit comments