Combination Sum Problem - A Non-recursive Method

Combination Sum Problem:

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.

Note:

• All numbers (including target) will be positive integers.
• Elements in a combination (a1,a2,⋯,ak) must be in non-descending order. (ie, a1≤a2≤⋯≤ak).
• The solution set must not contain duplicate combinations.

For example, given candidate set 2,3,6,7 and target 7,

a solution set is: [7]

[2, 2, 3]

The popular solution is to recursively scan all elements in the cadidate set, such as http://yucoding.blogspot.com/2012/12/leetcode-question-16-combination-sum.html.

However, I don’t want to use recursion

- See more at:http://bo-yang.github.io/2014/06/25/combination-sum/#sthash.sgAgIHh5.dpuf

 http://bo-yang.github.io/2014/06/25/combination-sum