一个集合的所有子集的Java代码实现
一个集合的所有子集的Java代码实现
- import java.io.*;
- public class dddde {
- public void displaySubSet(int setN[]) {
- int length = setN.length;
- int i;
- try {
- BufferedWriter writer = new BufferedWriter(new FileWriter(new File(
- "d:\\Result.txt")));
- for (i = 0; i < (1 << length); i++) {
- for (int j = 0; j < length; j++) {
- if ((i & (1 << j)) != 0) {
- writer.write("" + setN[j] + " ");
- }
- }
- writer.write("\r\n");
- }
- writer.close();
- } catch (Exception e) {
- }
- }
- public static void main(String[] args) {
- dddde ss = new dddde();
- int setN[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
- ss.displaySubSet(setN);
- }
- }
评论暂时关闭