回溯算法
PKU_CXK
北京大学信息科学技术学院
展开
-
LeetCode | 47. Permutations II
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], [2,1,1]]思路一:原创 2017-06-29 23:56:19 · 273 阅读 · 0 评论 -
LeetCode | 39. Combination Sum
Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C原创 2017-06-13 02:41:52 · 267 阅读 · 0 评论 -
LeetCode | 40. Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the combination.No原创 2017-06-15 17:08:34 · 310 阅读 · 0 评论 -
LeetCode | 60. Permutation Sequence——第K个全排列
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""312""321"原创 2017-07-06 22:50:42 · 522 阅读 · 0 评论 -
LeetCode | 77. Combinations
Given two integers n and k, return all possible combinations of k numbers out of 1 … n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]Solution递归原创 2017-09-06 11:42:08 · 292 阅读 · 0 评论 -
LeetCode | 78. Subsets
Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example,If nums = [1,2,3], a solution is:[ [3], [1], [2], [1,2原创 2017-09-07 10:58:02 · 346 阅读 · 0 评论