Given a set of distinct integers, S, return all possible subsets.
Note:
For
example,
If S = [1,2,3],
a solution is:
[ [3], [1], [2], [1,2,3], [1,3], [2,3], [1,2], [] ]
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17 |
public class Solution { public
ArrayList<ArrayList<Integer>> subsets(int[] S) { ArrayList<ArrayList<Integer> > result = new
ArrayList<ArrayList<Integer> >(); Arrays.sort(S); int
num = (int)Math.pow(2, S.length); for(int
i = 0; i < num; ++i){ ArrayList<Integer> list = new
ArrayList<Integer>(); String binaryreps = Integer.toBinaryString(i); for(int
j = 0; j < binaryreps.length(); ++j){ if(binaryreps.charAt(binaryreps.length() - 1
- j) == ‘1‘) list.add(S[j]); } result.add(list); } return
result; }} |
原文：http://www.cnblogs.com/averillzheng/p/3537222.html