key tips
使用动态规划法，
algorithm 1
动态规划
state[i][j] 表示s[i,j]是否为回文串，如果s[i,j]为回文串的充要条件是:
- s[i] == s[j]
- j -i ==1 or state[i+1][j-1]为true
在迭代求解过程中，要注意，在计算state[i][j]时引用了state[i+1][j-1]，因此state[i+1][j-1]要先于state[i][j]被计算
使用动态规划法，
动态规划
state[i][j] 表示s[i,j]是否为回文串，如果s[i,j]为回文串的充要条件是:
5. Longest Palindromic Substring
Welcome To My Blog 5. Longest Palindromic Substring (medi...
Leetcode 5. Longest Palindromic Substring. 【Medium】【Green...
5. Longest Palindromic Substring Given a string s, find t...
Given a string s, find the longest palindromic substring ...
Longest Palindromic Substring Input: "babad"Output: "bab"...
Given a string s, find the longest palindromic substring ...
Given a string s, find the longest palindromic substring ...
Given a string s, find the longest palindromic substring ...
Given a string s, find the longest palindromic substring ...
本文标题：5. Longest Palindromic Substring
本文链接：https://www.haomeiwen.com/subject/gnvctktx.html
网友评论