Python实现求一个集合所有子集的示例

Gytha ·

更新时间:2024-11-14

· 514 次阅读

方法一：回归实现


def PowerSetsRecursive(items):
  """Use recursive call to return all subsets of items, include empty set"""
  if len(items) == 0:
    #if the lsit is empty, return the empty list
    return [[]]
  subsets = []
  first_elt = items[0] #first element
  rest_list = items[1:]
  #Strategy:Get all subsets of rest_list; for each of those subsets, a full subset list
  #will contain both the original subset as well as a version of the sebset that contains the first_elt
  for partial_sebset in PowerSetsRecursive(rest_list):
    subsets.append(partial_sebset)
    next_subset = partial_sebset[:] +[first_elt]
    subsets.append(next_subset)
  return subsets


def PowerSetsRecursive2(items):
  # the power set of the empty set has one element, the empty set
  result = [[]]
  for x in items:
    result.extend([subset + [x] for subset in result])
  return result

方法二：二进制法


def PowerSetsBinary(items): 
  #generate all combination of N items 
  N = len(items) 
  #enumerate the 2**N possible combinations 
  for i in range(2**N): 
    combo = [] 
    for j in range(N): 
      #test jth bit of integer i 
      if(i >> j ) % 2 == 1: 
        combo.append(items[j]) 
    yield combo

以上这篇Python实现求一个集合所有子集的示例就是小编分享给大家的全部内容了，希望能给大家一个参考，也希望大家多多支持软件开发网。

您可能感兴趣的文章:Python编程之序列操作实例详解Python实现最大子序和的方法示例Python针对给定字符串求解所有子序列是否为回文序列的方法python实现输出一个序列的所有子序列示例

示例子集 Python

1024 个赞