leetcode77 Combinations

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],
]

Subscribe to see which companies asked this question

package leetcode77;

import java.util.ArrayList;
import java.util.List;

public class Solution {
	public List<List<Integer>> combine(int n, int k) {
		int[] num = new int[n+1];
		List<List<Integer>> result = new ArrayList<List<Integer>>();
		dfs(n, k, n, k, num, result);
		return result;
	}
	public void dfs(int n, int k, int x, int y,int[] num,List<List<Integer>> result){
		if(y==0){
			ArrayList<Integer> res = new ArrayList<Integer>();
			for(int i=1;i<=k;i++){
				res.add(num[i]);
			}
			result.add(res);
		}else{
			for(int i=x;i>=y;i--){
				num[y]=i;
				dfs(n, k, i-1, y-1, num, result);
			}
		}
	}
	public static void main(String[] args) {
		List<List<Integer>> result = new Solution().combine(4, 2);
		for(int i=0;i<result.size();i++){
			for(int j=0;j<result.get(i).size();j++){
				System.out.print(result.get(i).get(j));
			}
			System.out.println();
		}
	}
}