Longest Palindromic Substring

最新推荐文章于 2021-06-06 16:59:59 发布

Nereus_Li

最新推荐文章于 2021-06-06 16:59:59 发布

阅读量528

点赞数

分类专栏： LeetCode 文章标签：回文动态规划

本文链接：https://blog.csdn.net/li_chihang/article/details/44655093

版权

LeetCode 专栏收录该内容

113 篇文章 0 订阅

订阅专栏

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.

string longestPalindrome(string s) {

	vector<vector<bool> >dp(s.size(), vector<bool>(s.size(), true));
	//bool dp[s.size()][s.size()];
	for (int i = 0; i < s.size(); i++)
	for (int j = 0; j < s.size(); j++)
	if (i >= j)
		dp[i][j] = true;
	else dp[i][j] = false;
	int begin = 0, maxlen = 1;
	for (int len = 1; len < s.size(); ++len){
		for (int idx = 0; idx + len < s.size(); ++idx)
		{
			if (s[idx] == s[idx + len]){
				dp[idx][idx + len] = dp[idx + 1][idx + len - 1];
				if (dp[idx][idx + len] == true && len + 1 > maxlen){
					begin = idx;
					maxlen = len + 1;
				}

			}
			else
				dp[idx][idx + len] = false;
		}
	}
	return s.substr(begin, maxlen);
}

Time Limit Exceeded

 string longestPalindrome(string s) {
        int len = s.length(), max = 1, ss = 0, tt = 0;
        bool flag[len][len];
        for (int i = 0; i < len; i++)
            for (int j = 0; j < len; j++)
                if (i >= j)
                    flag[i][j] = true;
                else flag[i][j] = false;
        for (int j = 1; j < len; j++)
            for (int i = 0; i < j; i++)
            {
                if (s[i] == s[j])
                {
                    flag[i][j] = flag[i+1][j-1];
                    if (flag[i][j] == true && j - i + 1 > max)
                    {
                        max = j - i + 1;
                        ss = i;
                        tt = j;
                    }
                }
                else flag[i][j] = false;
            }
        return s.substr(ss, max);
    }