combinations java_Combinations.java

import java.util.ArrayList;

/**

* Given two integers n and k, return all possible combinations of k numbers out

* of 1 ... n. For example, If n = 4 and k = 2, a solution is:

*

* [ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4], ]

*

*/

public class Combinations {

public ArrayList> combine(int n, int k) {

ArrayList> result = new ArrayList>();

ArrayList subset = new ArrayList();

int[] num = new int[n];

for (int j = 0; j < n; j++) {

num[j] = j + 1;

}

subsets(n, k, num, 0, subset, result);

return result;

}

private void subsets(int n, int k, int[] num, int begin,

ArrayList subset, ArrayList> result) {

if (subset.size() >= k) {

ArrayList c = new ArrayList(subset);

result.add(c);

} else {

for (int i = begin; i < num.length; i++) {

subset.add(num[i]);

subsets(n, k, num, i + 1, subset, result);

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

}

}

}

}

一键复制

编辑

Web IDE

原始数据

按行查看

历史