5.Longest Palindromic Substring (String; DP, KMP)
摘要：
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 @ 2015-07-14 09:14 joannae 阅读(247) 评论(0) 推荐(0) 编辑
