2014年11月21日
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,3],[2,3,1],[3,... 阅读全文
posted @ 2014-11-21 23:58 li303491 阅读(219) 评论(0) 推荐(0)
Subsets II
摘要： 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-21 12:51 li303491 阅读(156) 评论(0) 推荐(0)
Subsets 集合子集 回溯
摘要： 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-21 00:20 li303491 阅读(184) 评论(0) 推荐(0)