LeetCode: Scramble StringGiven a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is o...
分类：
其他好文 时间：
2014-09-01 22:42:34
阅读次数：
308
I have to admit that I'm still an algorithm rookie: in front of a problem, I got lost on what the nature of the problem is.. usually I made everything...
分类：
其他好文 时间：
2014-08-24 08:03:32
阅读次数：
178
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 representatio...
分类：
其他好文 时间：
2014-08-21 00:01:23
阅读次数：
293
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 representatio...
分类：
其他好文 时间：
2014-08-13 22:17:17
阅读次数：
189
题目：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 represent....
分类：
编程语言 时间：
2014-08-07 05:11:29
阅读次数：
334
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-07-23 15:06:06
阅读次数：
320
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-07-06 13:57:54
阅读次数：
155
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.
分类：
其他好文 时间：
2014-07-02 10:03:09
阅读次数：
175
题目
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
/...
分类：
其他好文 时间：
2014-06-29 23:16:19
阅读次数：
312
原题地址：https://oj.leetcode.com/problems/scramble-string/题意：Given
a strings1, we may represent it as a binary tree by partitioning it to two
non-empty su...
分类：
编程语言 时间：
2014-06-09 19:02:59
阅读次数：
197
