# 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],
[]
]

public class Solution {
//solution 1: backtrace, enumerate all the situation
//solution 2: start {{}}
//            add 1 {{} {1}}
//            add 2 {{} {1} {2} {1, 2}}
//            add 3 {{} {1} {2} {1, 2} {3}, {1, 3}, {2, 3}, {1,2,3}}

//solution 3: bit mapulation number of array will have 2^n subset. eg, a,b,c for 3(011) => bc

// public void helper(List<List<Integer>>res, List<Integer> item, int start, int[] nums) {
//     if(item.size() == nums.length)
//         return;
//     for(int i = start; i < nums.length; i++) {
//         helper(res, item, i + 1, nums);
//         item.remove(item.size() - 1);
//     }
// }

// public List<List<Integer>> subsets(int[] nums) {
//     List<List<Integer>> res = new ArrayList<>();
//     if(nums == null || nums.length == 0)
//         return res;
//     Arrays.sort(nums);
//     helper(res, new ArrayList<Integer>(), 0, nums);
//     //add the [] to list
//     return res;
// }

// public List<List<Integer>> subsets(int[] nums) {
//     List<List<Integer>> res = new ArrayList<>();
//     if(nums == null || nums.length == 0)
//         return res;
//     Arrays.sort(nums);
//     for(int i = 0; i < nums.length; i++) {
//         int size = res.size();
//         for(int j = 0; j < size; j++) {
//             List<Integer> item = new ArrayList<>();
//         }
//     }
//     return res;
// }

public List<List<Integer>> subsets(int[] nums) {
List<List<Integer>> res = new ArrayList<>();
if(nums == null || nums.length == 0)
return res;
Arrays.sort(nums);

int size = 1 << nums.length;
for(int i = 1; i < size; i++) {
int flag = 1;
List<Integer> item = new ArrayList<>();
for(int j = 0; j < nums.length; j ++) {
if((i & flag) != 0) {
}
flag = flag << 1;
}
}
return res;
}
}
• 本文已收录于以下专栏：

## Leetcode : Subsets II

URL：https://leetcode.com/problems/subsets-ii/#/description题目大意：Given a collection of integers that m...

## leetcode 90. Subsets II

Given a collection of integers that might contain duplicates, nums, return all possible subsets. ...

## 【leetcode】90. Subsets II

leetcode, subsets ||， 3种解法

## leetcode：暴力枚举法之Subsets II

leetcode：暴力枚举法之Subsets II 题目; Given a collection of integers that might contain duplicates, S, retur...

## LeetCode OJ:Subsets II

Subsets II   Given a collection of integers that might contain duplicates, S, return all possible...

## leetcode-78 Subsets

• sole_cc
• 2015年03月28日 19:19
• 379

Subsets I and II

## Subsets II -- leetcode

Given a collection of integers that might contain duplicates, S, return all possible subsets. Not...

举报原因： 您举报文章：Subsets 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)