Skip to content

Update Fraz_recursion_7_2.java #15

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Niraj-Suryavanshi wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update Fraz_recursion_7_2.java #15

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 18 additions & 10 deletions Recursion/lecture 7/Fraz_recursion_7_2.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,20 +1,28 @@
ArrayList<ArrayList<Integer>> ans;
ArrayList<Integer> subSet;

void helper(ArrayList<Integer> v, int i, ArrayList<Integer> subSet, ArrayList<ArrayList<Integer>> ans) {
if (i == v.size()) {
ans.add(subSet);
import java.util.ArrayList;
public class Solution {
static ArrayList<ArrayList<Integer>> ans=new ArrayList<>();
static ArrayList<Integer> subSet=new ArrayList<Integer>();

public static void helper(ArrayList<Integer> v, int i, ArrayList<Integer> subSet, ArrayList<ArrayList<Integer>> ans)
{
if (i == v.size())
{
ans.add(new ArrayList<Integer>(subSet));
return;
}
// include the ith element
subSet.add(v.get(i));
helper(v, i + 1, subSet, ans);
// not including the ith element
subSet.remove(i);
subSet.remove(subSet.size() - 1);
helper(v, i + 1, subSet, ans);
}

ArrayList<ArrayList<Integer>> pwset(ArrayList<Integer> v) {

public static ArrayList<ArrayList<Integer>> pwset(ArrayList<Integer> v) {
// WRITE YOUR CODE HERE

helper(v, 0, subSet, ans);
return ans;
}
}
}