78. Subsets.txt

Leetcode - 78. Subsets
https://leetcode.com/problems/subsets/


import java.util.Arrays;
class Solution {
    public List<List<Integer>> subsets(int[] n) {
        Set<List<Integer>> arr= new HashSet<List<Integer>>();
        List<Integer> ar=new LinkedList<Integer>();
        traversal(0,n,arr,ar);
        List<List<Integer>> arrr=new LinkedList<List<Integer>>();
        arrr.addAll(arr);
        return arrr;
    }
    
    public void traversal(int a,int[] n, Set<List<Integer>> arr,List<Integer> ar){
        if(a==n.length){
            arr.add(new LinkedList<>(ar));
            return;
        }
        ar.add(n[a]);
        traversal(a+1, n,arr,ar);
        ar.remove(ar.size()-1);
        traversal(a+1, n,arr,ar);
    }
}