Permutations(46)

Permutations Given a collection of distinct 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], an

业界 2016年07月04日

[LintCode/LeetCode] Subsets & Subsets II

SubsetsProblemGiven a set of distinct integers, return all possible subsets.NoticeElements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.E

技术开发 2016年08月04日