leetcode JAVA Combinations 难度系数3 3.26

Question:

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 ArrayList<ArrayList<Integer>> combine(int n, int k) {
		ArrayList<ArrayList<Integer>> results = new ArrayList<ArrayList<Integer>>();
		ArrayList<Integer> result = new ArrayList<Integer>();
		dfs(n, k, 1, 0, result, results);
		return results;
	}

	private void dfs(int n, int k, int start, int current,
			ArrayList<Integer> result, ArrayList<ArrayList<Integer>> results) {
		if (current == k) {
			ArrayList<Integer> path = new ArrayList<Integer>(result);
			results.add(path);
			return;
		}
		for (int i = start; i <= n; i++) {
			result.add(i);
			dfs(n, k, i + 1, current + 1, result, results);
			result.remove(result.size() - 1);
		}

	}

	private void dfs(int n, int k, ArrayList<ArrayList<Integer>> results,
			ArrayList<Integer> result, int step) {
		if (k == 0) {
			ArrayList<Integer> path = new ArrayList<Integer>(result);
			results.add(path);
			return;
		}
		for (int i = step + 1; i <= n; i++) {
			result.add(i);
			dfs(n, k - 1, results, result, i);
			result.remove(result.size() - 1);
		}
	}