public class Solution { public ArrayList> subsets(int[] S) { // Start typing your Java solution below // DO NOT write main() function Arrays.sort(S); ArrayList> ans = new ArrayList>(); if(S.length==0) return ans; int kk = 0; kk = 1 << (S.length); for(int i=0;i tmp = new ArrayList(); int digit = 0; int k = i; int index = 0; while(index>= 1; if(digit==0){ tmp.add(S[index]); } index++; } ans.add(tmp); } return ans; } }