subset

Given a set of distinct integers, return all possible subsets.

java

public class Solution {
    
    /*
     * @param nums: A set of numbers
     * @return: A list of lists
     */
    public List<List<Integer>> subsets(int[] nums) {
        // write your code here
        List<List<Integer>> result = new ArrayList<>();
        List<Integer> list = new ArrayList<>();
        if (nums == null) {
            return result;
        }
        if (nums.length == 0) {
            result.add(list);
            return result;
        }
        Arrays.sort(nums);
        dfs(nums, 0, list, result);
        return result;
    }
    private void dfs(int[] nums, 
                     int startIndex,
                     List<Integer> list,
                     List<List<Integer>> result) {
        if (startIndex > nums.length) {
            return;
        }          
        result.add(new ArrayList<Integer>(list));
        for (int i = startIndex; i < nums.length; i++) {
            list.add(nums[i]);
            dfs(nums, i + 1, list, result);
            list.remove(list.size() - 1);
        }
    }
}

python

class Solution(object):
    def subsets(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        if nums is None or len(nums) == 0:
            return []
        result = []
        self.search(sorted(nums), 0, [], result)
        return result
        
        
    def search(self, nums, index, arr, result):
        if index >= len(nums):
            result.append(arr)
            return 
        self.search(nums, index + 1, arr + [nums[index]], result)
        self.search(nums, index + 1, arr, result)