暴力求解法——子集生成（位向量法）

Posted 2022-02-23 小乖乖的臭坏坏

代码：

public class Subset 
    public static void main(String[] args) 
        int[] A = 1,2,3,4,5;
        int[] B = new int[A.length];
        print_subset2(A.length, A, B, 0);
        
    

    public static void print_subset2(int n, int[] A, int[] B, int cur)
        if(cur==n)
            for (int i=0;i<cur;i++)
                if(B[i]!=0) System.out.print(A[i]+" ");
            
            System.out.println();
            return;
        
        B[cur]=1;
        print_subset2(n,A,B,cur+1);
        B[cur]=0;
        print_subset2(n,A,B,cur+1);