2015年2月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 longest palindromic substring. 大意是：从所给的字符串s中找出其... 阅读全文
posted @ 2015-02-13 10:15 薇清浅 阅读(202) 评论(0) 推荐(0) 编辑