摘要: Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa... 阅读全文
posted @ 2014-10-06 22:48 小菜刷题史 阅读(135) 评论(0) 推荐(0) 编辑