5. Longest Palindromic Substring Leetcode Python 2016 new Season

最新推荐文章于 2022-01-13 11:06:33 发布

hyperbolechi

最新推荐文章于 2022-01-13 11:06:33 发布

阅读量279

点赞数

分类专栏： leetcode 2016刷题

本文链接：https://blog.csdn.net/hyperbolechi/article/details/50454337

版权

leetcode 同时被 2 个专栏收录

166 篇文章 0 订阅

订阅专栏

2016刷题

45 篇文章 0 订阅

订阅专栏

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.

Show Company Tags

Show Tags

Show Similar Problems

There are two cases we need to deal with odd like 'ada' even like 'adda'

class Solution(object):
    def getPalindromeString(self, s, left_index, right_index):
        while left_index >= 0 and right_index < len(s) and s[left_index] == s[right_index]:
            left_index -= 1
            right_index += 1
        return s[left_index + 1 : right_index]
    def longestPalindrome(self, s):
        """
        :type s: str
        :rtype: str
        """
        longest_string = ''
        for  index in range(len(s)):
            first_string = self.getPalindromeString(s, index, index)
            second_string = self.getPalindromeString(s, index, index + 1)
            if len(first_string) > len(longest_string):
                longest_string = first_string
            if len(second_string) > len(longest_string):
                longest_string = second_string
        return longest_string