5. Longest Palindromic Substring[M]
Posted jessey-ge
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了5. Longest Palindromic Substring[M]相关的知识，希望对你有一定的参考价值。
题目
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
Example1：
? Input: "babad"
? Output: "bab"
? Note: "aba is also a valid answer. "
Example2：
? Input: "cbbd"
? Output: "bb"
思路
Tips
C++
Python
以上是关于5. Longest Palindromic Substring[M]的主要内容，如果未能解决你的问题，请参考以下文章
#Leetcode# 5. Longest Palindromic Substring
5. Longest Palindromic Substring - Unsolved
5. Longest Palindromic Substring
5. Longest Palindromic Substring