Complete this code You can write a recursive helper method that takes any number of arguments and then call it inside the method, but you cannot use any loops. /** * Decide if it is possible to divide the integers in a list into two sets, * so that the sum of one set is odd, and the sum of the other set is a multiple of 10. * Every integer must be in one set or the other. * For example, oddAndTen([5, 5, 3]) → true, * and oddAndTen([5, 5, 4]) → false. * @param list is a list of integers. * @return true iff there is one odd partition and the other multiple of 10. */ public static boolean oddAndTen(List list) { // call your recursive helper method return ... } private static boolean oddAndTenHelper(...) { // add any parameters // base case // recursive step
Complete this code
You can write a recursive helper method that takes any number of arguments and then call it inside the method, but you cannot use any loops.
/**
* Decide if it is possible to divide the integers in a list into two sets,
* so that the sum of one set is odd, and the sum of the other set is a multiple of 10.
* Every integer must be in one set or the other.
* For example, oddAndTen([5, 5, 3]) → true,
* and oddAndTen([5, 5, 4]) → false.
* @param list is a list of integers.
* @return true iff there is one odd partition and the other multiple of 10.
*/
public static boolean oddAndTen(List<Integer> list) {
// call your recursive helper method
return ...
}
private static boolean oddAndTenHelper(...) { // add any parameters
// base case
// recursive step
}
Step by step
Solved in 4 steps with 2 images