Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example, [1,1,2] have the following unique pe...
分类：
其他好文 时间：
2014-08-12 10:17:03
阅读次数：
142
Given a set of distinct integers,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not co...
分类：
其他好文 时间：
2014-08-12 03:00:33
阅读次数：
155
其实本题和：http://www.geeksforgeeks.org/count-possible-decodings-given-digit-sequence/是类似的。但是这道题需要考虑错误情况。 1 class Solution { 2 public: 3 int numDecodin...
分类：
其他好文 时间：
2014-08-11 20:33:52
阅读次数：
204
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...
分类：
其他好文 时间：
2014-08-11 17:49:32
阅读次数：
201
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].
原题链接：https://oj...
分类：
其他好文 时间：
2014-08-10 10:25:50
阅读次数：
265
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.
If such arrangement is not possible, it must rearrange it as the lowest possible o...
分类：
其他好文 时间：
2014-08-08 02:06:05
阅读次数：
207
题目：Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique....
分类：
编程语言 时间：
2014-08-08 01:54:55
阅读次数：
292
题目： 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 be....
分类：
编程语言 时间：
2014-08-07 12:08:49
阅读次数：
260
题目：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 digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon...
分类：
其他好文 时间：
2014-08-06 14:30:21
阅读次数：
213
