5最长回文子串Longest Palindromic Substring
Posted hozhangel
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了5最长回文子串Longest Palindromic Substring相关的知识,希望对你有一定的参考价值。
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
Example:
Input: "babad" Output: "bab" Note: "aba" is also a valid answer.
Example:
Input: "cbbd" Output: "bb"
把题目放着,先想想^^
以上是关于5最长回文子串Longest Palindromic Substring的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode 5. 最长回文子串 Longest Palindromic Substring
Leetcode 5. Longest Palindromic Substring(最长回文子串, Manacher算法)
5最长回文子串Longest Palindromic Substring
5. Longest Palindromic Substring 最长的回文子串