Recursion-2 > groupSum6
prev  |  next  |  chance

Given an array of ints, is it possible to choose a group of some of the ints, beginning at the start index, such that the group sums to the given target? However, with the additional constraint that all 6's must be chosen. (No loops needed.) groupSum6(0, {5, 6, 2}, 8) → true groupSum6(0, {5, 6, 2}, 9) → false groupSum6(0, {5, 6, 2}, 7) → false ...Save, Compile, Run public boolean groupSum6(int start, int[] nums, int target) { } See Also: Example Code Java help: If Boolean Logic | Strings | While and For Loops | Arrays and Loops prev  |  next  |  chance   |  JavaBat  >  Recursion-2

Forget It! -- delete my code for this problem 406.0

Copyright Nick Parlante 2006-09 - privacy