摘要: 题目: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 lon 阅读全文
posted @ 2016-03-26 23:20 强子GOR 阅读(186) 评论(0) 推荐(0)