2014年8月23日

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睡的略爽 阅读(140) 评论(0) 推荐(0)

Palindrome Partitioning系列

摘要： Palindrome Partitioning Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome parti 阅读全文

posted @ 2014-08-23 20:27 bug睡的略爽 阅读(162) 评论(0) 推荐(0)

导航