Python 求最大子集的遞歸實現

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): print('partial_sebset=',partial_sebset)subsets.append(partial_sebset) next_subset = partial_sebset[:] +[first_elt] subsets.append(next_subset) return subsets #f=['a','b','c','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s']f1=['a','b','c']g=PowerSetsRecursive(f1)print(g) [[], ['a'], ['b'], ['b', 'a'], ['c'], ['c', 'a'], ['c', 'b'], ['c', 'b', 'a']]

posted on 2018-06-23 21:48 luoganttcc 閱讀(...) 評論(...) 編輯 收藏

總結

以上是生活随笔為你收集整理的Python 求最大子集的递归实现的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。