2013年5月1日
[leetcode]Palindrome.Partitioning
摘要： Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s. For example, given s = "aab",Return [ ["aa","b"], ["a","a","b"] ]求解所有可能的回文划分。分析:p=pp(s[1...n])初始: if 阅读全文
posted @ 2013-05-01 16:56 wlu 阅读(404) 评论(0) 推荐(0)