摘要: 题目: 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 longest palindromic substring. 解题思路: 主要有三种: 第一种:... 阅读全文
posted @ 2014-05-01 13:22 mickole 阅读(301) 评论(0) 推荐(0) 编辑