摘要: 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 longes 阅读全文
posted @ 2017-04-01 16:13 会飞的胖子 阅读(176) 评论(0) 推荐(1) 编辑