Shirlies
宁静专注认真的程序媛~
摘要: 题目 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-08-08 15:03 Shirlies 阅读(271) 评论(0) 推荐(0) 编辑