Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, giv...
分类：
其他好文 时间：
2015-01-06 11:37:18
阅读次数：
91
问题描述：
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.
Below is one possible representation of s1 =
"great":
great
/ ...
分类：
其他好文 时间：
2015-01-05 21:55:47
阅读次数：
192
不知不觉居然已经写了200多篇随笔了，现在查找的时候经常要翻好久，很不方便。故给自己做个目录~Leetcode1、动态规划Palindrome Partitioning II(hard) ☆Distinct Subsequences(hard)Edit Distance (hard)Interlea...
分类：
其他好文 时间：
2015-01-02 14:32:34
阅读次数：
183
题目：Given a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representat...
分类：
其他好文 时间：
2015-01-02 06:29:15
阅读次数：
197
Palindrome Partitioning IIGiven a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a p...
分类：
其他好文 时间：
2015-01-01 16:00:58
阅读次数：
164
LeetCode: Palindrome 回文相关题目汇总LeetCode: Palindrome Partitioning 解题报告LeetCode: Palindrome Partitioning II 解题报告Leetcode:【DP】Longest Palindromic Substring...
分类：
其他好文 时间：
2014-12-30 20:37:58
阅读次数：
149
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ofs...
分类：
其他好文 时间：
2014-12-30 16:38:28
阅读次数：
194
Scramble StringGiven a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible...
分类：
其他好文 时间：
2014-12-27 21:37:15
阅读次数：
192
Given a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation...
分类：
其他好文 时间：
2014-12-17 12:23:10
阅读次数：
166
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","...
分类：
其他好文 时间：
2014-12-15 21:52:33
阅读次数：
145
