FilesExpand file tree

 master

/

6-1.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

21 lines (19 loc) · 731 Bytes

 master

/

6-1.py

Copy path

Top

File metadata and controls

• Code
• Blame

21 lines (19 loc) · 731 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

class Solution:

def longestPalindrome(self, s: str) -> str:

# 팰린드롬 판별 및 투 포인터 확장

def expand(left: int, right: int) -> str:

while left >= 0 and right < len(s) and s[left] == s[right]:

left -= 1

right += 1

return s[left + 1:right]

# 해당 사항이 없을때 빠르게 리턴

if len(s) < 2 or s == s[::-1]:

return s

result = ''

# 슬라이딩 윈도우 우측으로 이동

for i in range(len(s) - 1):

result = max(result,

expand(i, i + 1),

expand(i, i + 2),

key=len)

return result