LeetCode Subsets 解法

https://leetcode.com/problems/subsets/description/原题链接

给定一个含不同整数的集合，返回其所有的子集

注意 子集中的元素排列必须是非降序的，解集必须不包含重复的子集

如果 S = [1,2,3]，有如下的解：

[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

// 深度优先搜索的方式
class Solution {

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

        if (nums == null) {
            return results;
        }

        if (nums.length == 0) {
            results.add(new ArrayList<Integer>());
            return results;
        }

        Arrays.sort(nums);
        helper(new ArrayList<Integer>(), nums, 0, results);
        return results;
    }

    private void helper(ArrayList<Integer> subset,
                        int[] nums,
                        int startIndex,
                        List<List<Integer>> results) { 

        results.add(new ArrayList<Integer>(subset));

        for (int i = startIndex; i < nums.length; i++) {

            subset.add(nums[i]);

            helper(subset, nums, i + 1, results);

            subset.remove(subset.size() - 1);
        }
    }
 }

// 广度优先搜索的方式
public class Solution {

    public List<List<Integer>> subsets(int[] nums) {
         if(nums == null){
             return null;
         }

         Arrays.sort(nums);

         List<List<Integer>> result = new ArrayList<>();

         Queue<List<Integer>> que = new LinkedList<>();
         que.offer(new ArrayList<Integer>());

         while(!que.isEmpty()) {
            List<Integer> subset =  que.poll();
            result.add(subset);

            for(int i = 0; i < nums.length; i++) {
                if(subset.size() == 0 ||              
                subset.get(subset.size()-1) < nums[i]) {
                  List<Integer> temp =  new ArrayList<>(subset);
                  temp.add(nums[i]);
                  que.offer(temp);
                } 
            }

         }

         return result;
    }

}