[TOC]

P005 Longest Palindromic Substring

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.

思路分析

最長(zhǎng)回文最簡(jiǎn)單最直觀的思路就是：

• 從某個(gè)中點(diǎn)(middle)向兩邊掃描之道不是回文
  • 中點(diǎn)緊鄰的兩個(gè)點(diǎn)記為left和right
  • left 和 right有可能相等(字符串長(zhǎng)度為偶數(shù)時(shí))
  • 直到不是回文的時(shí)候?qū)⒃撦喲h(huán)的子串和上輪做比較取較長(zhǎng)者
• 遍歷所有的可能性---O(n^2)

代碼

java

public class Solution005 {
    private String longestPalindrome(String s, int left, int right) {
        while (left >= 0 && right < s.length() && s.charAt(left) == s.charAt(right)) {
            left--;
            right++;
        }
        return s.substring(left + 1, right);
    }

    public String longestPalindrome(String s) {
        if (s == null || s.length() == 0)
            return "";
        String ret = "";
        for (int i = 0; i < s.length() * 2 - 1; i++) {
            int left = i / 2;
            int right = i / 2;
            if ((i & 1) == 1)// 奇數(shù)
                right++;
            String tmp = this.longestPalindrome(s, left, right);
            if (ret.length() < tmp.length())
                ret = tmp;
        }
        return ret;
    }

}

python

class Solution005(object):
    
    def longestStr(self, s, left, right):
        l = len(s)
        while left >= 0 and right < l and s[left] == s[right]:
            left -= 1
            right += 1
        return s[left + 1:right]
            
        
    
    def longestPalindrome(self, s):
        """
        :type s: str
        :rtype: str
        """
        if not s : return ""
        
        ret = "";i = 0
        for i in range(len(s) * 2 - 1):
            left = i / 2
            right = i / 2
            if (i & 1) == 1:right += 1
            
            tmp = self.longestStr(s, left, right)
            
            if len(tmp) > len(ret):ret = tmp
        
        return ret