一起刷leetcode(78):Subsets
地址:
https://oj.leetcode.com/problems/subsets/
题号:
78
题目:
Subsets
描述:
Given a set of distinct integers, S, return all possible subsets.
Note:
Elements in a subset must be in non-descending order.
The solution set must not contain duplicate subsets.
For example,
If S = [1,2,3], a solution is:
[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[1,2],
[]
]
4 个回复
MrFat
赞同来自: qq用户61090
递归实现,全部组合可以位从n个元素中选取0~n(subsets方法中的i)个元素。而从n个元素中选取m个元素,在选取某一个元素后,可以看做从后续元素中选取m-1个元素(递归主题方法思路)。
Java代码如下