[알고리즘] 부분집합

부분집합

public static void subset(int cnt) {
    if(cnt == N) {
        return;
    }
    
    //선택
    isSelected[cnt] = true;
    subset(cnt+1);
    //비선택
    isSelected[cnt] = false;
    subset(cnt+1);
}

부분집합 - 공집합 제외

public static void subset(int cnt) {
    if(cnt == N) {
        int selectedCnt = 0;
        for(int i=0; i<N; i++) {
            if(isSelected[i]) selectedCnt++;
        }
        
        if(selectedCnt>0) {
            for(int i=0; i<N; i++) {
                if(isSelected[i]) System.out.println(result[i]+"\t");
            }
        }
        return;
    }
    
    //선택
    isSelected[cnt] = true;
    subset(cnt+1);
    //비선택
    isSelected[cnt] = false;
    subset(cnt+1);
}