| about | help | done | prefs | create account |
Recursion-2 > splitOdd10
prev | next | chance
| Given an array of ints, is it possible to divide the ints into two groups, so that the sum of one group is a multiple of 10, and the sum of the other group is odd. Every int must be in one group or the other. Write a recursive helper method that takes whatever arguments you like, and make the initial call to your recursive helper from splitOdd10(). (No loops needed.)
splitOdd10({5, 5, 5}) → true splitOdd10({5, 5, 6}) → false splitOdd10({5, 5, 6, 1}) → true ...Save, Compile, Run See Also: Example Code Java help: If Boolean Logic | Strings | While and For Loops | Arrays and Loops
|
Forget It! -- delete my code for this problem 421.0
Copyright Nick Parlante 2006-09 - privacy