题目:
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], [] ]分析:
跟有重复的可以是一样的代码啊O(∩_∩)O哈哈~
public class Solution {
public List<List<Integer>> subsets(int[] num) {
if (num == null)
return null;
Arrays.sort(num);
List<List<Integer>> result = new ArrayList<List<Integer>>();
List<List<Integer>> prev = new ArrayList<List<Integer>>();
for (int i = num.length-1; i >= 0; i--) {
//get existing sets
if (i == num.length - 1 || num[i] != num[i + 1] || prev.size() == 0) {
prev = new ArrayList<List<Integer>>();
for (int j = 0; j < result.size(); j++) {
prev.add(new ArrayList<Integer>(result.get(j)));
}
}
//add current number to each element of the set
for (List<Integer> temp : prev) {
temp.add(0, num[i]);
}
//add each single number as a set, only if current element is different with previous
if (i == num.length - 1 || num[i] != num[i + 1]) {
ArrayList<Integer> temp = new ArrayList<Integer>();
temp.add(num[i]);
prev.add(temp);
}
//add all set created in this iteration
for (List<Integer> temp : prev) {
result.add(new ArrayList<Integer>(temp));
}
}
//add empty set
result.add(new ArrayList<Integer>());
return result;
}
}