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 3029507

Browse files
committed
optimize 5
1 parent c697d5e commit 3029507

File tree

1 file changed

+6
-2
lines changed

1 file changed

+6
-2
lines changed

‎005/longest_palindromic_substring.py‎

Lines changed: 6 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -10,9 +10,13 @@ def longestPalindrome(self, s):
1010
for i in range(0, len(s) - length + 1):
1111
temp = s[i:i + length]
1212
if self.is_palindromic(temp) and len(temp) > len(result):
13-
result= temp
13+
return temp
1414
length -= 1
1515
return result
1616

1717
def is_palindromic(self, s):
18-
return s == s[::-1]
18+
if len(s) == 0 or len(s) == 1:
19+
return True
20+
if s[:1] != s[-1:]:
21+
return False
22+
return self.is_palindromic(s[1:-1])

0 commit comments

Comments
(0)

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