Merge pull request #373 from z80160280/z80160280-patch-18

Update 0516.最长回文子序列.md
This commit is contained in:
程序员Carl
2021-06-11 15:33:39 +08:00
committed by GitHub

View File

@ -170,7 +170,20 @@ public class Solution {
Python
```python
class Solution:
def longestPalindromeSubseq(self, s: str) -> int:
dp = [[0] * len(s) for _ in range(len(s))]
for i in range(len(s)):
dp[i][i] = 1
for i in range(len(s)-1, -1, -1):
for j in range(i+1, len(s)):
if s[i] == s[j]:
dp[i][j] = dp[i+1][j-1] + 2
else:
dp[i][j] = max(dp[i+1][j], dp[i][j-1])
return dp[0][-1]
```
Go
```Go