# Easy to understand Recursive Solutions in Java with Explanation

• As everyone told, this is a 0-1 Knapsack problem. In my solution, the focus is not time or memory efficiency. Instead, I would like to generate a code which is simple to understand and easy to maintain.

So, the main idea is, for each string, we will decide whether

• use remaining 0s and 1s (if there are enough of them) and count that string or
• do not use any 0s and 1s and skip that string entirely

Here is this solution:

``````public class Solution {

public int findMaxForm(String[] strs, int m, int n) {
return findMaxFormStartingWith(strs, m, n, 0);
}

private int findMaxFormStartingWith(String[] strs, int m, int n, int begin) {
if ((begin==strs.length) || (m+n==0)) {
return 0;
}
String current = strs[begin];
int zeroes = countZeroesIn(current);
int ones = current.length()-zeroes;
if (m>=zeroes && n>=ones) {
countByAddingString = 1 + findMaxFormStartingWith(strs, m-zeroes, n-ones, begin+1);
}
int countBySkippingString = findMaxFormStartingWith(strs, m, n, begin+1);
}
return countBySkippingString;
}

private int countZeroesIn(String str) {
int count = 0;
for (int i=0; i<str.length(); i++) {
if (str.charAt(i) == '0') {
count++;
}
}
return count;
}
}
``````

With this code, for each string, we count the zeroes in it by `countZeroesIn(String str)` and see if there are enough 0s and 1s for it. If so, we accumulate that string and proceed with the remaining strings, 0s and 1s by means of the following code:

`countByAddingString = 1 + findMaxFormStartingWith(strs, m-zeroes, n-ones, begin+1);`

We also take the other route, which simply skips the string and does not use any 0s and 1s.

`countBySkippingString = findMaxFormStartingWith(strs, m, n, begin+1);`

Whichever is bigger, is that the result.

The main problem with this approach is, it is too slow. Why? Beacause, it does not take advantage of previously solved subproblems. The Dynamic Programming comes in to the scene. What we will add is a simple table, which holds the previous answers and return them whenever we need them.

`findMaxFormStartingWith(strs, m, n, begin)` is called by 4 parameters. The string array is provided for practical purposes. It can be simply left out by declaring a private field for the class. The actual parameters are the remaining 0s (`m`), 1s (`n`) and current string index `begin`. I preferred to create a 3D integer array to store and retrieve the results of subproblems. Each dimension represents the respective values of the parameters.

``````  private int[][][] dpTable;

public int findMaxForm(String[] strs, int m, int n) {
dpTable = new int[m+1][n+1][strs.length];
return findMaxFormStartingWith(strs, m, n, 0);
}
``````

The arrays in Java are 0-indexed, hence `m+1` and `n+1` make the array operations easier for us. With this array in our hands, we will have two extra operations:

• return the result if we have solved for these parameters before
• store the result for further access

These are the steps that decrease the time required to solve the problem. And these are the steps that we can use as Dynamic Programming.

This modification can be seen in the final version below.

``````  private int findMaxFormStartingWith(String[] strs, int m, int n, int begin) {
if ((begin==strs.length) || (m+n==0)) {
return 0;
}
// return the result if we have solved for these parameters before
if (dpTable[m][n][begin] > 0) {
return dpTable[m][n][begin];
}
String current = strs[begin];
int zeroes = countZeroesIn(current);
int ones = current.length()-zeroes;
if (m>=zeroes && n>=ones) {
countByAddingString = findMaxFormStartingWith(strs, m-zeroes, n-ones, begin+1)+1;
}
int countBySkippingString = findMaxFormStartingWith(strs, m, n, begin+1);
// store the result for further access