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], [] ]解题思路:
先把空集加入总集:注意 这里不是null而是[]
然后从1开始到n往总集里添加
[][1]
[][1][2][1,2]
[][1][2][1,2][3][1,3][2,3][1,2,3]
[][1][2][1,2][3][1,3][2,3][1,2,3][4][1,4][2,4][1,2,4][3,4][1,3,4][2,3,4][1,2,3,4]
...
直接上代码 参考Code_Ganker大神
注:因为这道题要求元素必须递增,所以得先排序
public ArrayList<ArrayList<Integer>> subsets(int[] S) {
ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
result.add(new ArrayList<Integer>());
if(S == null || S.length == 0)
return result;
Arrays.sort(S);
for(int i=0;i<S.length;i++) {
int size=result.size();
for(int j=0;j<size;j++) {
ArrayList<Integer> temp = new ArrayList<Integer>(result.get(j));
temp.add(S[i]);
result.add(temp);
}
}
return result;
}