![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Backtrack
文章平均质量分 73
ActiveCoder
An active programmer
展开
-
LeetCode 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], and [3,2,1]. Class原创 2016-04-14 05:30:16 · 234 阅读 · 0 评论 -
LeetCode 39. Combination Sum
Given a set of candidate numbers (C) 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 unlimited numbe原创 2016-04-15 05:38:58 · 220 阅读 · 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 combinatio原创 2016-04-15 07:47:31 · 287 阅读 · 0 评论 -
LeetCode 216. Combination Sum III
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers. Ensure that numbers wit原创 2016-04-15 09:31:15 · 363 阅读 · 0 评论 -
LeetCode 97. Interleaving String
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example, Given: s1 = "aabcc", s2 = "dbbca", When s3 = "aadbbcbcac", return true. When s3 = "aadbbbaccc", return原创 2016-04-18 09:20:42 · 284 阅读 · 0 评论