Permutation 各种变种

import java.util.ArrayList;

import java.util.HashSet;

import java.util.List;

import java.util.Set;

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.

public class combinationSumIII {

public static void main(String[] args) {

List<List<Integer>> res = combinationSum3(2, 4);

for (List<Integer> each : res) {

System.out.println(each);

}

}

public static List<List<Integer>> combinationSum3(int k, int n) {

List<List<Integer>> res = new ArrayList<List<Integer>>();

List<Integer> each = new ArrayList<Integer>();

if (k < 1 || n < 1)

return res;

helper(res, each, k, n, 0, 0, 1);

return res;

}

//找到unique set, [2,2]不符合，[1,3]符合，并且按从小到大排序

private static void helper(List<List<Integer>> res, List<Integer> each,

int k, int n, int level, int sum, int start) {

if (level == k && sum == n) {

res.add(new ArrayList<Integer>(each));

return;

}

if (level == k || sum > n) {

return;

}

for (int i = start; i <= 3; i++) {

each.add(i);

helper(res, each, k, n, level + 1, sum + i, i + 1);//注意start = i + 1, 不是start + 1， 否则会出现[2,2]的错误情况

each.remove(each.size() - 1);

}

}

//找到非降序的排列

private static void helper2(List<List<Integer>> res, List<Integer> each,

int k, int n, int level, int sum, int start) {

if (level == k && sum == n) {

res.add(new ArrayList<Integer>(each));

return;

}

if (level == k || sum > n) {

return;

}

for (int i = start; i <= 3; i++) {

each.add(i);

helper2(res, each, k, n, level + 1, sum + i, start + 1);//注意start = start + 1

each.remove(each.size() - 1);

}

}

// 找到所有可能的组合：其中start就没有用了，每次都从头扫

private static void helper3(List<List<Integer>> res, List<Integer> each,

int k, int n, int level, int sum, int start) {

if (level == k && sum == n) {

res.add(new ArrayList<Integer>(each));

return;

}

if (level == k || sum > n) {

return;

}

for (int i = 1; i <= 3; i++) {

each.add(i);

helper3(res, each, k, n, level + 1, sum + i, i + 1);

each.remove(each.size() - 1);

}

}

}