【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 within the set are sorted in ascending order.

Example 1:

Input: k = 3, n = 7

Output:

[[1,2,4]]

Example 2:

Input: k = 3, n = 9

Output:

[[1,2,6], [1,3,5], [2,3,4]]

二、问题分析

与之前的combinations是一类题目，都是backtracking。方法也都是一样的，具体看代码。

三、Java AC代码

public List<List<Integer>> combinationSum3(int k, int n) {
		List<List<Integer>> res = new ArrayList<List<Integer>>();
		List<Integer> item = new ArrayList<Integer>();
		if (k<1 || n<1) {
			return res;
		}
		dfdHelper(res, item, k, n, 1, 0);
		return res;
	}
	public void dfdHelper(List<List<Integer>> res, List<Integer> item, int k, int n, int start, int sum){
		if (sum > n || item.size()>k) {
			return ;
		}
		if (item.size()==k && sum==n) {
			res.add(new ArrayList<Integer>(item));
			return ;
		}
		for (int i = start; i < 10; i++) {
			sum += i;
			item.add(i);
			dfdHelper(res, item, k, n, i+1, sum);
			item.remove(item.size()-1);
			sum -= i;
		}
	}