LeetCode | Longest Palindromic Substring

最新推荐文章于 2021-02-13 07:28:33 发布

KarmenChan

最新推荐文章于 2021-02-13 07:28:33 发布

阅读量92

点赞数

分类专栏： LeetCode 文章标签： LeetCode 最长回文子串

本文链接：https://blog.csdn.net/Karmen199x/article/details/89684392

版权

LeetCode 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

5.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.

Example

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

Solution: (java)

class Solution {
    public String longestPalindrome(String s) {
        String result = "";
        int maxlength = 0;
        int MaxRight = 0, pos = 0;

        StringBuffer sb = new StringBuffer();
        sb.append("#");
        for (int i = 0; i < s.length(); i++) {
            sb.append(s.charAt(i));
            sb.append("#");
        }

        int [] RL = new int[sb.length()];
        for (int i = 0; i < RL.length; i++) {
            RL[i] = 0;
        }

        for (int i = 0; i < sb.length(); i++) {
            if (i < MaxRight) {
                RL[i] = Math.min(RL[2*pos-i], MaxRight-i);
            } else {
                RL[i] = 1;
            }

            while (i-RL[i] >= 0 && i+RL[i] < sb.length() && sb.charAt(i-RL[i]) == sb.charAt(i+RL[i])) {
                RL[i] += 1;
            }

            if (RL[i]+i-1 > MaxRight) {
                MaxRight = RL[i] + i -1;
                pos = i;
            }

            if (RL[i] > maxlength) {
                maxlength = RL[i];  // for return the lenght: maxlength - 1
                result = sb.substring(i - RL[i] + 1, i + RL[i] - 1);
            }
        }
        String ret = "";
        for (int i = 0; i < result.length(); i++) {
            if (result.charAt(i) != '#') {
                ret += result.charAt(i);
            }
        }

        return ret;
    }
}