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

Commit 850d6c1

Browse files
committed
update 005
1 parent 067a602 commit 850d6c1

File tree

1 file changed

+8
-5
lines changed

1 file changed

+8
-5
lines changed

‎LeetCodeSolutions/005.py‎

Lines changed: 8 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -17,16 +17,19 @@ def palindrome(s, i, j):
1717
i -= 1
1818
j += 1
1919
return s[i+1: j]
20-
res = ""
20+
res = ''
2121
for i in range(len(s)):
2222
s1 = palindrome(s, i, i)
2323
s2 = palindrome(s, i, i+1)
24-
res=resif len(res) >= len(s1) else s1
25-
res=resif len(res) >= len(s2) else s2
24+
if len(s1) > len(res): res= s1
25+
if len(s2) > len(res): res= s2
2626
return res
2727

2828
s = "cbbd"
29-
s = "a"
30-
s = ""
29+
s = "aba"
30+
# s = "aaa"
31+
s = "aaaa"
32+
# s = ""
33+
# s = "a"
3134
mat = Solution()
3235
mat.longestPalindrome(s)

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /