LeetCode Longest Palindromic Substring

来源:互联网 发布:今年网络流行词 编辑:程序博客网 时间:2024/05/22 08:17

题目:

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.

//DP,f[i][j]表示从s[i]-s[j]表示的字符串是否是回文class Solution {public:string longestPalindrome(string s) {if (s.size() == 0)return s;bool f[1000][1000] = { false };int len = 1;int ss = 0;//初始化for (int i = 0; i < s.size(); i++)f[i][i] = true;for (int j = 1; j < s.size(); j++) {for (int i = 0; i < j; i++) {if (s[i] == s[j]) {if (i + 1 == j)f[i][j] = true;elsef[i][j] = f[i + 1][j - 1];if (f[i][j] && len < j - i + 1) {len = j - i + 1;ss = i;}}elsef[i][j] = false;}}return s.substr(ss, len);}};


0 0
原创粉丝点击