[LeetCode] 5. Longest Palindromic Substring 最长回文子串

Given a string s, return the longest palindromic substring in s. Example 1: Input: s = "babad" Output: "bab" Explanation: "aba" is also a valid answer
posted @ 2015-04-29 00:09  Grandyang  阅读(81125)  评论(31)    收藏  举报
Fork me on GitHub