Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit3433f21

Browse files
authored
Create 0516-longest-palindromic-subsequence.py
1 parent77d4982 commit3433f21

File tree

1 file changed

+60
-0
lines changed

1 file changed

+60
-0
lines changed
Lines changed: 60 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,60 @@
1+
# Time: O(n^2) Space: O(n^2) - For all three solutions
2+
classSolution:
3+
deflongestPalindromeSubseq(self,s:str)->int:
4+
# Dynamic Programming
5+
dp= [ [0]* (len(s)+1)foriinrange(len(s)+1)]
6+
res=0
7+
8+
foriinrange(len(s)):
9+
forjinrange(len(s)-1,i-1,-1):
10+
ifs[i]==s[j]:
11+
dp[i][j]=1ifi==jelse2
12+
ifi-1>=0:
13+
dp[i][j]+=dp[i-1][j+1]
14+
else:
15+
dp[i][j]=dp[i][j+1]
16+
ifi-1>=0:
17+
dp[i][j]=max(dp[i][j],dp[i-1][j])
18+
res=max(res,dp[i][j])
19+
returnres
20+
21+
22+
# Memoization
23+
cache= {}
24+
25+
defdfs(i,j):
26+
ifi<0orj==len(s):
27+
return0
28+
if (i,j)incache:
29+
returncache[(i,j)]
30+
31+
ifs[i]==s[j]:
32+
length=1ifi==jelse2
33+
cache[(i,j)]=length+dfs(i-1,j+1)
34+
else:
35+
cache[(i,j)]=max(dfs(i-1,j),dfs(i,j+1))
36+
returncache[(i,j)]
37+
38+
foriinrange(len(s)):
39+
dfs(i,i)# odd length
40+
dfs(i,i+1)# even length
41+
42+
returnmax(cache.values())
43+
44+
# LCS Solution
45+
classSolution:
46+
deflongestPalindromeSubseq(self,s:str)->int:
47+
returnself.longestCommonSubsequence(s,s[::-1])
48+
49+
50+
deflongestCommonSubsequence(self,s1:str,s2:str)->int:
51+
N,M=len(s1),len(s2)
52+
dp= [[0]* (M+1)for_inrange(N+1)]
53+
54+
foriinrange(N):
55+
forjinrange(M):
56+
ifs1[i]==s2[j]:
57+
dp[i+1][j+1]=1+dp[i][j]
58+
else:
59+
dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j])
60+
returndp[N][M]

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp