[Python][프로그래머스][Level3] 가장 긴 팰린드롬

def solution(s):
    answer=0
    for start in range(len(s)-1):
        end = start+1
        while end<len(s) and start>=0:
            if s[start]==s[end]:
                answer=max(answer,end-start+1)
            else:
                break
            start-=1
            end+=1
    for start in range(len(s)-2):
        end = start+2
        while end<len(s) and start>=0:
            if s[start]==s[end]:
                answer=max(answer,end-start+1)
            else:
                break
            start-=1
            end+=1
    
    return answer if answer!=0 else 1