[LeetCode] Longest Palindromic Substring

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

lyangpku

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

阅读量465

点赞数

分类专栏： DP LeetCode 面试题算法文章标签： dp DP Leetcode leetcode LeetCode 算法面试题

本文链接：https://blog.csdn.net/lyangpku/article/details/8552877

版权

LeetCode 同时被 3 个专栏收录

110 篇文章 0 订阅

订阅专栏

面试题

110 篇文章 0 订阅

订阅专栏

算法

110 篇文章 0 订阅

订阅专栏

class Solution {
public:
    string longestPalindrome(string s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int len = s.length();
        int max_len = 0;
        int pos = 0;
        
        int dp[len][len];
        
        for (int i = 0; i < len; i++)
    		for (int j = 0; j < len; j++)
				dp[i][j] = (i >= j);
        
        for (int l = 1; l < len; l++) {
            for (int i = 0; i + l < len; i++) {
                int j = i + l;
                if (s[i] != s[j])
                    dp[i][j] = false;
                else
                    dp[i][j] = dp[i + 1][j - 1];
                
                if (dp[i][j] && l > max_len) {
                    max_len = l;
                    pos = i;
                }
            }
        }
        
        return s.substr(pos, max_len + 1);
    }
};

Small Case: 8ms

Large Case: 1608ms

Time: O(n^2)

Space: O(n^2)

有O(n)的解法