摘要: 题目: 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 lo 阅读全文
posted @ 2016-06-13 18:31 CodingGirl121 阅读(129) 评论(0) 推荐(0) 编辑