Java实现组合排列的小程序

public class Zuhe { private int m; private int[] set; private boolean first;//布尔型 private int position; public Zuhe(int n, int m) { this.m = m; first = true; position = n - 1; set = new int[n]; for(int i = 0; i < n; i++) set[i] = i + 1; } public boolean hasNext() { return set[0] < m - set.length + 1; } public int[] next() { if(first) { first = false; return set; } if(set[set.length-1] == m) position--; else position = set.length - 1; set[position]++; for(int i = position + 1; i < set.length; i++) set[i] = set[i-1] + 1; return set; } public static void main(String[] args) { Zuhe nOfm = new Zuhe(3,10); while(nOfm.hasNext()) { int[] set = nOfm.next(); for(int i = 0; i < set.length; i++) { System.out.print(set[i]); System.out.print(" "); } System.out.println(); } } }