LeetCode-5. Longest Palindromic Substring [C++][Java]

LeetCode-5. Longest Palindromic SubstringLevel up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/longest-palindromic-substring/

题目描述

Given a string s, return the longest palindromic substring in s.

Example 1:

Input: s = "babad"
Output: "bab"
Explanation: "aba" is also a valid answer.

Example 2:

Input: s = "cbbd"
Output: "bb"

Constraints:

• 1 <= s.length <= 1000
• s consist of only digits and English letters.

解题思路

【C++解法】

1. 动态规划

dp[i][j]表示为s[i,j]是否为回文串；注意单字符一定为回文串，那么dp表格的对角线就可以预先填上
当s长度小于等于2时，s是否为回文串，只需要判断s[i]和s[j]是否相等
当s长度大于2时，沿 ↗ 方向，即判断s[i][j]是否为回文，就只要判断内部为回文串即两端是否相等

class Solution {
public:
    string longestPalindrome(string s) {
        int n = s.size();
        vector< vector<int>> dp(n, vector<int>(n,0));
        int start = 0, maxLen= 0;
        for(int i=0; i<n; i++) {
            for(int j=0; j<=i; j++) {
                if(s[i]==s[j] && (i-j<3 || dp[i-1][j+1])) {
                    dp[i][j] = 1;
                }
                int len = i-j+1;
                if(len>=maxLen && dp[i][j]) {
                    maxLen = len ;
                    start = j;
                }
            }
        }
        return s.substr(start, maxLen);
    }
};

或者，遍历长度

class Solution {
public:
    string longestPalindrome(string s) {
        int n = s.size();
        vector< vector<int>> dp(n, vector<int>(n,0));
        int start = 0, maxLen = 1;
        for (int i=0; i<n; i++) {
		    dp[i][i]=1;
		    if ((i<n-1) && (s[i]==s[i+1])) {
                dp[i][i+1]=1;
                start = i;
                maxLen=2; //初始化时注意当前最长回文子串长度；
		    }
    	}
        for (int L=3; L<=n; L++) {//枚举子串长度
            for (int i=0; i+L-1<n; i++) {//枚举子串起始端点
				int j=i+L-1;//子串右端点
				if (s[i]==s[j] && dp[i+1][j-1]==1) {
					dp[i][j] = 1;
					maxLen = L;//更新最长回文子串长度;
                    start = i;
				}
			}
        }
        return s.substr(start, maxLen);
    }
};

2. 中心扩展

回文的对称性：相等的字符串一定为回文，那么即可以把整个相等的子串看作一个回文整体

class Solution {
public:
    string longestPalindrome(string s) {
        int n = s.length();
        if (n < 2) return s;
        int maxLen = 0, start = 0;
        for (int i = 0; i < n;) {
            if (n - i < maxLen/2) break;
            int left = i, right = i;
            while (right < n - 1 && s[right+1] == s[right]) {++right;}
            i = right + 1;
            while (right < n - 1 && left > 0 && s[right+1] == s[left-1]) {
                ++right;
                --left;
            }
            int len = right - left + 1;
            if(len > maxLen) {
                maxLen = len;
                start = left;
            }
        }
        return s.substr(start, maxLen);
    }
};

【Java解法】

1. 动态规划

class Solution {
    public String longestPalindrome(String s) {
        int n = s.length();
        if (n < 2) {return s;}
        boolean[][] dp = new boolean[n][n];
        int maxLen = 0, start = 0;
        for (int i=0; i<n; i++) {
            for (int j=0; j<=i; j++) {
                dp[i][j] = (s.charAt(j) == s.charAt(i) && (i - j < 3 || dp[i-1][j+1]));
                int len = i - j + 1;
                if (dp[i][j] && len > maxLen) {
                    maxLen = len;
                    start = j;
                }
            }
        }
        return s.substring(start, start + maxLen);
    }
}

2. 中心扩展

class Solution {
    public String longestPalindrome(String s) {
        int n = s.length();
        if (n < 2) {return s;}
        int maxLen = 0, start = 0;
        for (int i=0; i<n;) {
            if (n - i < maxLen / 2) {break;}
            int left = i, right = i;
            while (right < n - 1 && s.charAt(right) == s.charAt(right+1)){right++;}
            i = right + 1;
            while (right < n - 1 && left > 0 && s.charAt(left-1) == s.charAt(right+1)) {
                left--;
                right++;
            }
            int len = right - left + 1;
            if (len > maxLen) {
                maxLen = len;
                start = left;
            }
        }
        return s.substring(start, start + maxLen);
    }
}

参考文献

【1】动态规划之最长回文子串_叫我莫言鸭的博客-CSDN博客_最长回文子串

【2】5.最长回文子串(四种方法)_高一少年的博客-CSDN博客_最长回文子串