087 Scramble String这道题是divide and conquer。 使用sorted可以快速判断 要不然会超时class Solution: # @param {string} s1 # @param {string} s2 # @return {boolean}...
分类：
其他好文 时间：
2015-08-01 12:52:49
阅读次数：
146
To solve this problem, you first need to understand it well. The key problem is tell the difference of scramble from permutations. You may refer to th...
分类：
其他好文 时间：
2015-08-01 12:52:27
阅读次数：
106
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
/ gr ...
分类：
其他好文 时间：
2015-07-25 10:44:04
阅读次数：
128
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...
分类：
其他好文 时间：
2015-07-16 00:36:56
阅读次数：
151
题目链接 题目要求： Given a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possib...
分类：
其他好文 时间：
2015-06-16 16:08:21
阅读次数：
120
题目：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-06-09 06:13:42
阅读次数：
93
题目：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-06-03 15:33:00
阅读次数：
168
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...
分类：
编程语言 时间：
2015-05-20 01:57:32
阅读次数：
192
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
/ gr ...
分类：
其他好文 时间：
2015-04-23 17:40:47
阅读次数：
205
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
/ gr ...
分类：
编程语言 时间：
2015-04-17 11:38:26
阅读次数：
129
