摘要: Given a string S, find the longest palindromic substring inS. You may assume that the maximum length ofS is 1000, and there exists one unique longest ... 阅读全文
posted @ 2015-09-07 15:15 hbpeng 阅读(126) 评论(0) 推荐(0)