Recca Chao 的 gitHub page

推廣網站開發,包含 Laravel 和 Kotlin 後端撰寫、自動化測試、讀書心得等。Taiwan Kotlin User Group 管理員。

View on GitHub

Hi, here's your problem today. This problem was recently asked by Facebook:

Given a list of unique numbers, generate all possible subsets without duplicates. This includes the empty set as well.

Here's an example and some starter code.

def generateAllSubsets(nums):
  # Fill this in.

print(generateAllSubsets([1, 2, 3]))
# [[], [3], [2], [2, 3], [1], [1, 3], [1, 2], [1, 2, 3]]