标签: algorithm set subset
给定一组角色和该集合的多个子集,重建原始集合所需的最小子集是多少?
示例:
Input : set={x,y,z} subsets = {{x,y}, {y,z}, {y,z}} Expected output : {{x,y}, {y,z}}
另一个例子:
Input: set = {w,x,y,z} subset = {{w,x},{w},{x,y,z}} Expected output : {{w},{x,y,z}}