algorithm - Unique successful combinations in knapsack -

algorithm - Unique successful combinations in knapsack -

i have simpler variation of knapsack. interested find unique members in array sum given value. code below:

public void process(int w){ knaprecurse(arr.length-1,w); } private void knaprecurse(int n,int w){ if(arr[n]>w) knaprecurse(n-1,w); if(arr[n]==w) { //add unique members list targetlist.add(....);//how? } if(arr[n]<w){ knaprecurse(n-1,w); knaprecurse(n-1,w-arr[n]); } }

how record each unique combination adds value?

algorithm dynamic-programming knapsack-problem