SunnyQjm/algorithm-review
1
0 Fork 0
mirror of https://github.com/SunnyQjm/algorithm-review.git synced 2026-10-05 01:15:46 +08:00
Code Issues Releases Wiki Activity

Update 1_longest-palindromic-substring.py

Browse Source
This commit is contained in:
SunnyQjm authored and GitHub committed 2020-06-21 10:32:15 +08:00
1 parent 6f4c145338
commit ba3c315fde
1 file changed
+1 -1
Download Patch File Download Diff File Expand all files Collapse all files
chapter7/1_longest-palindromic-substring.py
+1 -1
View File
@@ -42,7 +42,7 @@ class Solution:
for i in range(2, len(s)):
for j in range(0, len(s) - i):
if dp[j + 1][j + i - 1] and s[j] == s[j + i]:
find, resultStart, resultEnd, dp[j][j + i] = True, j, j + i + 1, True
resultStart, resultEnd, dp[j][j + i] = j, j + i + 1, True
return s[resultStart: resultEnd]