LeetCode 5 Longest Palindromic Substring

最新推荐文章于 2024-11-07 00:05:38 发布

mlweixiao

最新推荐文章于 2024-11-07 00:05:38 发布

阅读量667

点赞数

分类专栏： leetcode 文章标签： java leetcode

本文链接：https://blog.csdn.net/mlweixiao/article/details/40625709

版权

leetcode 专栏收录该内容

120 篇文章 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.

思路1：使用暴力

	public String longestPalindrome(String s)
	{
		int n=s.length();
	    int i=0, j=0, max=1,c=1;
	    String result=s;
	    for (i = 0; i < n; i++) { // i is the middle point of the palindrome  
	        for (j = 0; (i - j >= 0) && (i + j < n); j++){ // if the length of the palindrome is odd  
	            if (s.charAt(i-j) !=s.charAt(i+j))
	                break;
	            c = j * 2 + 1;
	        }
	        if (c > max){
	            max = c;
	            result=s.substring(i-j+1,i+j);
	        }
	        for (j = 0; (i - j >= 0) && (i + j + 1 < n); j++){ // for the even case  
	            if (s.charAt(i-j) != s.charAt(i+j+1))
	                break;
	            c = j * 2 + 2;
	        }
	        if (c > max){
	            max = c;
	            result=s.substring(i-j+1,i+j+1);
	        }
	    }
	    return result;
	}

思路2：使用manacher算法，我觉得我说的不会比以下几篇文章说的更清楚了

http://blog.csdn.net/ggggiqnypgjg/article/details/6645824

关于证明，以下这篇blog说的很清楚的： http://blog.sina.com.cn/s/blog_70811e1a01014esn.html

不过JAVA版的代码如下：由 http://leetcode.com/2011/11/longest-palindromic-substring-part-ii.htmlC++版的代码改写而成：

public class Solution {
	// Transform S into T.
	// For example, S = "abba", T = "$#a#b#b#a#^".
	// ^ and $ signs are sentinels appended to
	// each end to avoid bounds checking
	private String preProcess(String s) {
		if (s.length() == 0)
			return "$#";
		StringBuffer sb = new StringBuffer("$#");
		for (int i = 0; i < s.length(); i++) {
			sb.append(s.charAt(i));
			sb.append('#');
		}
		sb.append("^");
		return sb.toString();
	}

	public String longestPalindrome(String s) {
		String t = preProcess(s);
		int n = t.length();
		int[] p = new int[n];
		int id = 0, mx = 0;
		for (int i = 1; i < n-1; i++) {
			int j = 2 * id - i; // equals to i' = id - (i-id)
			p[i] = mx > i ? Math.min(mx - i, p[j]) : 0;

			// Attempt to expand palindrome centered at i
			while (t.charAt(i + p[i]) == t.charAt(i - p[i])) {
				p[i]++;
			}
			// If palindrome centered at i expand past R,
			// adjust center based on expanded palindrome.
			if (i + p[i] > mx) {
				id = i;
				mx = i + p[i];
			}
		}

		// Find the maximum element in P.
		int maxLen = 0;
		int centerIndex = 0;
		for (int i = 0; i < n; i++) {
			if (p[i] > maxLen) {
				maxLen = p[i];
				centerIndex = i;	
			}
		}
		
		return s.substring((centerIndex - maxLen) / 2,
				(centerIndex - maxLen) / 2+maxLen-1);
	}
}