最长回文子串是什么意思
时间: 2023-09-26 14:06:15 浏览: 55
最长回文子串指的是一个字符串中最长的身为回文串的子串。回文串是指从前往后读和从后往前读一模一样的字符串。所以最长回文子串就是在给定字符串中,长度最长的回文子串。举个例子,字符串"abbacabba"中,最长回文子串为"abbacabba",长度为9。<span class="em">1</span><span class="em">2</span><span class="em">3</span>
#### 引用[.reference_title]
- *1* [最长回文子串](https://blog.csdn.net/qq_40507857/article/details/79822846)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_1"}}] [.reference_item style="max-width: 33.333333333333336%"]
- *2* [最长回文子串问题(Manacher算法)](https://blog.csdn.net/weixin_46103589/article/details/128335728)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_1"}}] [.reference_item style="max-width: 33.333333333333336%"]
- *3* [动态规划算法(2)最长回文子串详解](https://blog.csdn.net/jj6666djdbbd/article/details/128106783)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_1"}}] [.reference_item style="max-width: 33.333333333333336%"]
[ .reference_list ]