| about | help | done | prefs | create account |
Java > Recursion-2 > splitArray
prev | next | chance
| Given an array of ints, is it possible to divide the ints into two groups, so that the sums of the two groups are the same. 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 splitArray(). (No loops needed.)
splitArray({2, 2}) → true splitArray({2, 3}) → false splitArray({5, 2, 3}) → true ...Save, Compile, Run See also Java Example Code. Java help docs: If Boolean Logic | Strings | While and For Loops | Arrays and Loops
|
Forget It! -- delete my code for this problem 418.0
Copyright Nick Parlante 2006-10 - privacy