<LeetCode OJ> 78. Subsets
Posted EbowTang
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了<LeetCode OJ> 78. Subsets相关的知识,希望对你有一定的参考价值。
Given a set of distinct integers, nums, 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 nums = [1,2,3]
, a solution is:
[ [3], [1], [2], [1,2,3], [1,3], [2,3], [1,2], [] ]
以上是关于<LeetCode OJ> 78. Subsets的主要内容,如果未能解决你的问题,请参考以下文章