5.Longest Palindromic Substring

OovEver

于 2017-12-09 17:05:53 发布

阅读量159

点赞数

分类专栏： LeetCode 文章标签： string leetcode-java

本文链接：https://blog.csdn.net/mupengfei6688/article/details/78760279

版权

LeetCode 专栏收录该内容

137 篇文章 0 订阅

订阅专栏

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


}