[leetCode] Subsets
2015-05-07 23:40
330 查看
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 =
is:
public class Solution {
List<List<Integer>> res = new ArrayList<List<Integer>>();
public List<List<Integer>> subsets(int[] nums) {
Arrays.sort(nums);
List<Integer> item = new ArrayList<Integer>();
res.add(item);
sub(nums, 0, item);
return res;
}
private void sub(int[] nums, int index, List<Integer> input) {
for (int i = index; i < nums.length; i++) {
List<Integer> item = new ArrayList<Integer>(input);
item.add(nums[i]);
res.add(item);
sub(nums, i + 1, item);
}
}
}
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 {
List<List<Integer>> res = new ArrayList<List<Integer>>();
public List<List<Integer>> subsets(int[] nums) {
Arrays.sort(nums);
List<Integer> item = new ArrayList<Integer>();
res.add(item);
sub(nums, 0, item);
return res;
}
private void sub(int[] nums, int index, List<Integer> input) {
for (int i = index; i < nums.length; i++) {
List<Integer> item = new ArrayList<Integer>(input);
item.add(nums[i]);
res.add(item);
sub(nums, i + 1, item);
}
}
}
相关文章推荐
- LeetCode题解:Subsets
- leetcode笔记:Subsets
- LeetCode - 78 - Subsets(求数组全部子集)
- 算法15: leetcode 698. Partition to K Equal Sum Subsets
- LeetCode-Subsets
- leetcode 之 Subsets
- Leetcode 78. Subsets & 90. Subsets II
- LeetCode--Subsets(集合的子集)Python
- LeetCode Subsets
- LeetCode Subsets II
- LeetCode-Subsets
- leetcode — subsets-ii
- Leetcode110: Subsets
- [LeetCode]—Subsets 求数组子集
- 【LeetCode】Subsets
- LeetCode-Subsets
- [Leetcode] Subsets
- LeetCode No.78 Subsets
- [LeetCode] Partition to K Equal Sum Subsets
- Leetcode--Subsets