A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a .....
分类：
其他好文 时间：
2015-03-08 17:06:45
阅读次数：
151
Given a collection of numbers that might contain duplicates, return all possible unique permutations.
For example,
[1,1,2] have the following unique permutations:
[1,1,2], [1,2,1],
and [2,1,1]....
分类：
其他好文 时间：
2015-03-07 18:42:23
阅读次数：
128
Permutations问题：Given a collection of numbers, return all possible permutations.For example,[1,2,3]have the following permutations:[1,2,3],[1,3,2],[2,1...
分类：
其他好文 时间：
2015-03-07 17:07:00
阅读次数：
134
https://oj.leetcode.com/problems/permutations/Given a collection of numbers, return all possible permutations.For example,[1,2,3]have the following pe...
分类：
其他好文 时间：
2015-03-07 16:54:54
阅读次数：
134
Given a collection of numbers, return all possible permutations.
For example,
[1,2,3] have the following permutations:
[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2],
and [3,2,1].
题意：生成所有的序列。
思路...
分类：
其他好文 时间：
2015-03-07 15:47:55
阅读次数：
112
Given a digit string, return all possible letter combinations that the number could represent.
A mapping of digit to letters (just like on the telephone buttons) is given below.
Input:Digit string...
分类：
其他好文 时间：
2015-03-07 01:02:15
阅读次数：
210
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-03-06 16:15:45
阅读次数：
149
Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below ...
分类：
其他好文 时间：
2015-03-05 20:48:00
阅读次数：
156
题目描述：Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the tel...
分类：
其他好文 时间：
2015-03-05 16:43:43
阅读次数：
156
