题目描述: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 number of times.
分析:用深度优先搜索处理这个问题,但需要剪枝以减少循环次数,降低复杂度(刚开始做的时候没有剪枝,超时)。因为同一个数可以重复使用,所以下一次搜索的起点还是当前节点。
变题: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.
分析:下一次搜索的起点是当前节点的下一个结点。