2016年11月27日
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. Ex... 阅读全文
posted @ 2016-11-27 16:05 copperface 阅读(354) 评论(0) 推荐(0) 编辑