| about | help | done | prefs | create account |
Java > Recursion-2 > groupSumClump
prev | next | chance
| Given an array of ints, is it possible to choose a group of some of the ints, such that the group sums to the given target, with this additional constraint: if there are numbers in the array that are adjacent and the identical value, they must either all be chosen, or none of them chosen. For example, with the array {1, 2, 2, 2, 5, 2}, either all three 2's in the middle must be chosen or not, all as a group. (one loop can be used to find the extent of the identical values).
groupSumClump(0, {2, 4, 8}, 10) → true groupSumClump(0, {1, 2, 4, 8, 1}, 14) → true groupSumClump(0, {2, 4, 4, 8}, 14) → false ...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 415.0
Copyright Nick Parlante 2006-10 - privacy