find all subsets that sum to x - using an initial code
问题 I am trying to build upon a problem, to solve another similar problem... given below is a code for finding the total number of subsets that sum to a particular value, and I am trying to modify the code so that I can return all subsets that sum to that value (instead of finding the count). Code for finding the total number of suibsets that sum to 'sum': /** * method to return number of sets with a given sum. **/ public static int count = 0; public static void countSubsetSum2(int arr[], int k,