LeetCode Longest Palindromic Substring

Description:

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.

Solution 1: TLE

public class Solution {

	boolean dp[][];
	int l;

	public String longestPalindrome(String s) {
		String str = "";
		l = s.length();
		dp = new boolean[l][l];

		for (int i = 0; i < l; i++) {
			dp[i][i] = true;
			str = "" + s.charAt(0);
		}
		for (int i = 1; i < l; i++) {
			if (s.charAt(i - 1) == s.charAt(i)) {
				dp[i - 1][i] = true;
				str = s.substring(i - 1, i + 1);
			}
		}

		for (int len = 2; len <= l; len++) {
			for (int i = 0; i < l - len; i++) {
				int j = i + len;
				if (dp[i + 1][j - 1] && s.charAt(i) == s.charAt(j)) {
					dp[i][j] = true;
					str = s.substring(i, j + 1);
				}
			}
		}

		return str;
	}

	public static void main(String[] args) {
		String s = "ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggg";
		// String s = "a";
		Solution so = new Solution();
		long t1 = System.currentTimeMillis();
		System.out.println(so.longestPalindrome(s));
		long t2 = System.currentTimeMillis();
		System.out.println(t2 - t1);
	}
}

Solution 2: manacher algorithm O(n) see hdu 3068

Learn more about manacher

import java.util.Arrays;

public class Solution {

	boolean dp[][];
	int l;

	public String longestPalindrome(String s) {
		int l = s.length();
		char arr[] = new char[2 * l + 3];
		arr[0] = '$';
		arr[1] = '#';
		for (int i = 0; i < l; i++) {
			arr[i * 2 + 2] = s.charAt(i);
			arr[i * 2 + 3] = '#';
		}
		arr[2 * l + 2] = '?';

		int id = 1, mx = 0;
		int p[] = new int[arr.length];
		p[1] = 1;
		for (int i = 1; i < 2 * l + 2; i++) {
			if (mx > i) {
				p[i] = Math.min(p[2 * id - i], mx - i);
			} else {
				p[i] = 1;
			}

			while (arr[i - p[i]] == arr[i + p[i]])
				p[i]++;
			if (i + p[i] > mx) {
				id = i;
				mx = i + p[i];
			}
		}

		int len = 1;
		for (int i = 0; i < p.length; i++)
			if (len < p[i] - 1) {
				len = p[i] - 1;
				id = i;
			}
		String ans = "";
		for (int i = id - p[id] + 1; i < id + p[id]; i++)
			if (arr[i] != '#')
				ans += arr[i];
//		System.out.println(ans);
		return ans;
	}

	public static void main(String[] args) {
		// String s =
		// "ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggg";
		String s = "ccd";
		Solution so = new Solution();
		long t1 = System.currentTimeMillis();
		System.out.println(so.longestPalindrome(s));
		long t2 = System.currentTimeMillis();
		System.out.println(t2 - t1);
	}
}

Although two methods are both OK, but I think the latter one just focus more on algorithm thinking, which requires a high performance on algorithm. So I think the first one is just fine.