LeetCode – Combination Sum

public IList<IList<int>> CombinationSum(int[] candidates, int target)
{
	if(candidates == null || candidates.Length == 0){
		return null;
	}


	var arr = candidates.OrderBy(x=>x).ToList();
	
	IList<IList<int>> result = new List<IList<int>>();
	Travel(arr ,new List<int>(), 0, target, result);
	
	return result;
}




private void Travel(IList<int> candidates, IList<int> arr, int index, int target, IList<IList<int>> result){
	if(target == 0 ){
		result.Add(new List<int>(arr));
		return ;
	}
	
	for(var i = index ;i < candidates.Count; i++){
		if(target < candidates[i]){
			return;
		}
		
		arr.Add(candidates[i]);
		Travel(candidates, arr, i + 1 , target - candidates[i], result);
		arr.Remove(candidates[i]);
	}
}

LeetCode – Combination Sum

原文：http://blog.csdn.net/lan_liang/article/details/49108349