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
Given a string s, partition s such that every substring of the partition is a palindrome.
Return the minimum cuts needed for a palindrome partitioning of s.
For example, given s = "aab",
Return...
分类:
其他好文 时间:
2014-12-15 21:50:08
阅读次数:
172
Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ...
分类:
其他好文 时间:
2014-12-12 06:44:13
阅读次数:
201
题目和上题一样leetcode Palindrome Partitioning,这里需要求的是最小的分割数,也就是上一题的所有可能里面最少的一个分割。例如:For example, givens="aab",Return1since the palindrome partitioning["aa",...
分类:
其他好文 时间:
2014-12-10 00:20:54
阅读次数:
334
把一个字符串划分成几个回文子串,枚举所有可能的划分例如For example, givens="aab",Return[ ["aa","b"], ["a","a","b"] ]写一个子函数判断是否为回文。然后dfs,这个dfs比之前的稍微难理解一些。dfs函数每次输入的起点代表之前已经处理好了,从这...
分类:
其他好文 时间:
2014-12-08 02:03:17
阅读次数:
128
这是LeetCode上的一道题目,求出对于一个string,至少切多少刀可以让所有的substring都是回文串。原题是 https://oj.leetcode.com/problems/palindrome-partitioning-ii/Given a string s, partition s...
分类:
其他好文 时间:
2014-12-07 16:24:04
阅读次数:
215
Palindrome Partitioning IIGiven a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for ...
分类:
其他好文 时间:
2014-12-06 22:52:25
阅读次数:
291