摘要: 原题如下: Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique 阅读全文
posted @ 2016-08-15 17:42 pkufork 阅读(415) 评论(0) 推荐(0) 编辑