摘要：
Given a collection of integers that might contain duplicates,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.... 阅读全文
posted @ 2014-11-13 09:06
Phoebe815
阅读(130)
评论(0)
推荐(0)
摘要：
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... 阅读全文
posted @ 2014-11-13 08:59
Phoebe815
阅读(131)
评论(0)
推荐(0)
摘要：
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2]have the following unique perm... 阅读全文
posted @ 2014-11-13 06:14
Phoebe815
阅读(117)
评论(0)
推荐(0)
摘要：
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,... 阅读全文
posted @ 2014-11-13 06:05
Phoebe815
阅读(176)
评论(0)
推荐(0)
摘要：
Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))... 阅读全文
posted @ 2014-11-13 05:44
Phoebe815
阅读(152)
评论(0)
推荐(0)
摘要：
Given two integersnandk, return all possible combinations ofknumbers out of 1 ...n.For example,Ifn= 4 andk= 2, a solution is:[ [2,4], [3,4], [2,3],... 阅读全文
posted @ 2014-11-13 03:45
Phoebe815
阅读(159)
评论(0)
推荐(0)
摘要：
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Each number ... 阅读全文
posted @ 2014-11-13 02:39
Phoebe815
阅读(209)
评论(0)
推荐(0)
摘要：
Given a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Thesamerepeated num... 阅读全文
posted @ 2014-11-13 02:14
Phoebe815
阅读(163)
评论(0)
推荐(0)
摘要：
Given a collection of intervals, merge all overlapping intervals.For example,Given[1,3],[2,6],[8,10],[15,18],return[1,6],[8,10],[15,18].Solution: 1 /*... 阅读全文
posted @ 2014-11-13 01:36
Phoebe815
阅读(149)
评论(0)
推荐(0)
浙公网安备 33010602011771号