生成可重集排列

输入：3

           1 1 1

输出：111

输入：3

          1 1 2

输出：111
          112
          121
          122
          211
          212
          221

          222

解：

 public class Main {

	static int[] a;
	static int[] b;
	static TreeSet<String> t;

	public static void fun(int cur, int n) {
		if (cur == n) {
			String s = Arrays.toString(b);
			s = s.replace(", ", "");
			s = s.replace("[", "");
			s = s.replace("]", "");
			t.add(s);
			return;
		}
		for (int i = 0; i < n; i++) {
			b[cur] = a[i];
			fun(cur + 1, n);
		}
	}

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		a = new int[n];
		b = new int[n];
		t = new TreeSet<>();
		for (int i = 0; i < n; i++) {
			a[i] = in.nextInt();
		}
		fun(0, n);
		Iterator<String> it = t.iterator();
		while (it.hasNext()) {
			System.out.println(it.next());
		}
	}
}