LeetCode刷题day039 (Jieky)

LeetCode第39题 Combination Sum

/*
Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.

The same repeated number may be chosen from candidates unlimited number of times.

Note:

All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.


Example 1:
Input: candidates = [2,3,6,7], target = 7,
A solution set is:
[
  [7],
  [2,2,3]
]

Example 2:
Input: candidates = [2,3,5], target = 8,
A solution set is:
[
  [2,2,2,2],
  [2,3,3],
  [3,5]
]
*/
import java.util.*;
public class CombinationSum{
	public static void main(String[] args){
		int[] nums = {2,3,5};
		int target = 8;
		CombinationSum cs = new CombinationSum();
		List<List<Integer>> result = cs.combinationSum(nums, target);
		System.out.println(result);
	}
	
	// 穷举的办法
	public List<List<Integer>> combinationSum(int[] nums,int target){
		List<List<Integer>> list = new ArrayList<>();
		backtrack(list,nums,target,new ArrayList<Integer>(),0);
		return list;
	}

	private void backtrack(List<List<Integer>> list,int[] nums,int remaind,List<Integer> tempList,int start){
		if (remaind < 0) {
			return;
		}else if(remaind == 0) {
			list.add(new ArrayList<>(tempList));
		}else{
			for (int i=start;i<nums.length;i++){
				tempList.add(nums[i]);
				backtrack(list,nums,remaind-nums[i],tempList,i);
				// backtrack运行完只有两种可能：remaind==0 or ramaind < 0
				tempList.remove(tempList.size()-1);
			}
		}
	}
}