So even bunnies has 2 ears and odd ones have 3 ears and we have to return total ears?
Recursion-1 > bunnyEars2
prev | next | chance
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
public int bunnyEars2(int bunnies) {
int result=0;
if(bunnies==0){
result=0;
}
else{
if(bunnies%2==1){
result=2+bunnyEars2(bunnies-1);
}
else if(bunnies%2==0){
result=3+bunnyEars2(bunnies-1);
}
}
return result;
}
Title | # Comments | Views | Activity |
---|---|---|---|
network + | 7 | 73 | |
java and programming certification ? | 4 | 65 | |
eclipse java build path | 6 | 20 | |
java.io.BufferedReader readLine() //returns the entire file ? | 4 | 32 |
Join the community of 500,000 technology professionals and ask your questions.
Connect with top rated Experts
10 Experts available now in Live!