LeetCode 算法刷题(5)

5. Longest Palindromic Substring

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of sis 1000.

Example:

Input: "babad"

Output: "bab"

Note: "aba" is also a valid answer.

Example:

Input: "cbbd"

Output: "bb"

Subscribe to see which companies asked this question.

 public static 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;
    }