Leetcode Solution of Longest Palindromic Substring in Java

1. Naive Approach Naively, we can simply examine every substring and check if it is palindromic. The time complexity is O(n^3). If this is submitted to LeetCode onlinejudge, an error message will be returned - "Time Limit Exceeded". Therefore, this approach is just a start, we need better algorithm. public static String longestPalindrome1(String s) {   int maxPalinLength = 0; String longestPalindrome = null; int length = s.length();   // check all possible sub strings for (int i = 0; i < length; i++) { for (int j = i + 1; j < length; j++) { int len = j - i; String curr = s.substring(i, j + 1);

Read full article from Leetcode Solution of Longest Palindromic Substring in Java