用java递归写代码输出 子集树 111 110 101 011.....000
时间: 2023-12-06 22:44:18 浏览: 30
以下是用 Java 递归实现输出子集树的代码:
```java
public class SubsetsTree {
public static void main(String[] args) {
int n = 3;
int[] subset = new int[n];
generateSubsets(subset, 0);
}
public static void generateSubsets(int[] subset, int i) {
if (i == subset.length) {
printSubset(subset);
} else {
subset[i] = 1;
generateSubsets(subset, i + 1);
subset[i] = 0;
generateSubsets(subset, i + 1);
}
}
public static void printSubset(int[] subset) {
for (int i : subset) {
System.out.print(i);
}
System.out.println();
}
}
```
输出结果为:
```
111
110
101
100
011
010
001
000
```