Leetcode 78 subset 求子集

題目如下： Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate subsets. Example: Input: nums = [1,2,3] Output: [ [3],  

>>阅读原文<<