2014年5月13日
Leetcode | 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-05-13 12:06 linyx 阅读(160) 评论(0) 推荐(0) 编辑