Leetcode||5.Longest Palindromic Substring

5. Longest Palindromic Substring

• Total Accepted: 140882
• Total Submissions: 588176
• Difficulty: Medium
• Contributors: Admin

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

本题是寻找最长回文字符串，通常是用dp和KMP做，也有用 Manacher’s Algorithm算法的，我用的是dp。不过，我怎么也没想到，我加了{return "";}会超时。

代码如下：

public class Solution {
    public String longestPalindrome(String s) {
        if(s == null || s.length()==0) 
			return "";  
	    boolean[][] palin = new boolean[s.length()][s.length()];  
	    String res = "";  
	    int maxLen = 0;  
	    for(int i=s.length()-1;i>=0;i--)  
	    {  
	        for(int j=i;j<s.length();j++)  
	        {  
	            if(s.charAt(i)==s.charAt(j) && (j-i<=2 || palin[i+1][j-1]))  
	            {  
	                palin[i][j] = true;  
	                if(maxLen<j-i+1)  
	                {  
	                    maxLen=j-i+1;  
	                    res = s.substring(i,j+1);  
	                }  
	            }  
	        }  
	    }  
	    return res;  
    }
}