标签:longest tips mic strong 思路 c++ NPU length out
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"
5. Longest Palindromic Substring[M]
标签:longest tips mic strong 思路 c++ NPU length out
原文地址:https://www.cnblogs.com/Jessey-Ge/p/10992522.html