LeetCode题解：Subsets

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

题意：给定元素，返回所有可能的子集

解决思路：类似于求组合那题的思路，先添加一个数，然后插入第二个数的时候不断复制

代码：

public class Solution {
    public List<List<Integer>> subsets(int[] nums) {
        List<List<Integer>> result = new ArrayList<List<Integer>>();

        int subsetNum = (int)Math.pow(2, nums.length);
        Arrays.sort(nums);

        for(int i = 0; i < subsetNum; i++){
            result.add(new ArrayList<Integer>());
        }

        for(int i = 0; i < nums.length; i++){
            for(int j = 1; j < subsetNum; j++){
                List<Integer> temp = result.get(j);

                if(((j >> i) & 1) == 1){
                    temp.add(nums[i]);
                }
            }
        }

        return result;
    }
}