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.
Input: "cbbd"
Output: "bb"
暂时还没写出来
标签：out not note sub code pre bsp imu amp
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.
Input: "cbbd"
Output: "bb"
暂时还没写出来
LeeCode（5. Longest Palindromic Substring）
标签：out not note sub code pre bsp imu amp
原文地址：https://www.cnblogs.com/roostinghawk/p/8228985.html
