We have bunnies standing in a line, numbered 1, 2, ... The odd bunnies (1, 3, ..) have the normal 2 ears. The even bunnies (2, 4, ..) we'll say have 3 ears, because they each have a raised foot. Recursively return the number of "ears" in the bunny line 1, 2, ... n (without loops or multiplication).
bunnyEars2(0) → 0
bunnyEars2(1) → 2
bunnyEars2(2) → 5
Solution:
public int bunnyEars2(int bunnies) {
/*Base condition*/
if(bunnies == 0)
return 0;
/*For odd bunnies*/
if(bunnies% 2== 0)
return bunnyEars2(bunnies-1) + 3;
else /*For even bunnies*/
return bunnyEars2(bunnies-1) + 2;
}
Read full article from Tech Savvy: Bunny Ears
