编写一个程序,打印所有子集
Problem Statement:
问题陈述:
Print all possible subset of a set
打印一组中所有可能的子集
Example:
例:
input : {1,2,3,4}
output :
{}
{1}
{2}
{1,2}
{3}
{1,3}
{2,3}
{1,2,3}
{4}
{1,4}
{2,4}
{1,2,4}
{3,4}
{1,3,4}
{2,3,4}
{1,2,3,4}
Explanation:
说明:
The total number of possible subset a set can have is 2^n, where n is the number of elements in the set.
一个集合可以具有的可能子集的总数为2 ^ n ,其中n是集合中元素的数量。
We can generate all possible subset using binary counter.
我们可以使用二进制计数器生成所有可能的子集。
For example:
例如:
Consider a set 'A' having elements {a, b, c}. So we will generate binary number upto 2^n - 1 (as we will include 0 also).
考虑具有元素