Longest Palindromic Substring
摘要:
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 @ 2014-08-23 20:48 bug睡的略爽 阅读(134) 评论(0) 推荐(0) 编辑