mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-05 00:25:22 +08:00
36 lines
793 B
Markdown
Executable File
36 lines
793 B
Markdown
Executable File
# [78. Subsets](https://leetcode.com/problems/subsets/)
|
||
|
||
|
||
## 题目
|
||
|
||
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],
|
||
[1],
|
||
[2],
|
||
[1,2,3],
|
||
[1,3],
|
||
[2,3],
|
||
[1,2],
|
||
[]
|
||
]
|
||
|
||
|
||
## 题目大意
|
||
|
||
给定一组不含重复元素的整数数组 nums，返回该数组所有可能的子集（幂集）。说明：解集不能包含重复的子集。
|
||
|
||
|
||
## 解题思路
|
||
|
||
- 找出一个集合中的所有子集，空集也算是子集。且数组中的数字不会出现重复。用 DFS 暴力枚举即可。
|
||
- 这一题和第 90 题，第 491 题类似，可以一起解答和复习。
|
||
|