N数的M个数组合

package day0207;

import java.util.Scanner;

public class N数的M个数组合 {
	static int n;
	static int m;
	static int [] num = null;
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		n = scan.nextInt();
		m = scan.nextInt();
		num = new int[m+1];
		dfs(1,1);
		
		
		
	}
	
	public static void dfs(int i,int setp) {
		if(setp==m+1) {
			for (int k = 1; k <= m; k++) {
				System.out.print(num[k]+" ");
			}
			System.out.println();
			return ;
		}
		
		
		for (int j = i; j <= n; j++) {
			num[setp] = j;
			dfs(j+1,setp+1);
		}
		
		
	}
}