5.Longest Palindromic Substring

来源：互联网发布：地方新闻网站源码编辑：程序博客网时间：2024/06/18 18:49

5.Longest Palindromic Substring

题目描述：Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

Example:

Input: "babad"Output: "bab"Note: "aba" is also a valid answer.

Example:
```
Input: "cbbd"Output: "bb"
```
题目大意：找出字符串中的最长回文子串

代码

package String;/*** @Author OovEver* @Date 2017/12/9 16:39*/public class LeetCode5 {  private int lo, maxLen;  public String longestPalindrome(String s) {      int len = s.length();      if (len < 2) {          return s;      }      for(int i=0;i<s.length();i++) {          extendPalindrome(s, i, i);//奇数          extendPalindrome(s, i, i + 1);//偶数      }      return s.substring(lo, lo + maxLen);  }  private void extendPalindrome(String s, int j, int k) {      while (j >= 0 && k < s.length() && s.charAt(j) == s.charAt(k)) {          j--;          k++;      }      if (maxLen < k - j - 1) {          lo = j + 1;          maxLen = k - j - 1;      }  }}

阅读全文

0 0