Recursion - 2 (groupSum5) Java Solution || Codingbat.com

[위엔빈]

simple is mine;

if(start >= nums.length) return target == 0;

if(nums[start]%5 == 0) {
if(start+1 != nums.length && nums[start+1] == 1)
return (groupSum5(start+2, nums, target-nums[start]));
return (groupSum5(start+1, nums, target-nums[start]));
}
return (groupSum5(start+1, nums, target)) ||
(groupSum5(start+1, nums, target-nums[start]));