LeetCode 78 Subsets

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

思路：穷举。

public class Solution {
	public List<List<Integer>> subsets(int[] S) {
		List<List<Integer>> result = new ArrayList<List<Integer>>();
		if(S==null) return result;
		
		Arrays.sort(S);
		int len=S.length;
		for(long i=0;i<(1<<len);i++){
			
			String str=Long.toBinaryString(i);
			List<Integer> list=new ArrayList<Integer>();
			for(int j=str.length()-1;j>=0;j--){
				if(str.charAt(j)=='1') list.add(S[str.length()-1-j]);
			}
			result.add(list);
		}
		
		return result;
	}
}