Recursion-1 > triangle
prev | next | chance
We have triangle made of blocks. The topmost row has 1 block, the next row down has 2 blocks, the next row has 3 blocks, and so on. Compute recursively (no loops or multiplication) the total number of blocks in such a triangle with the given number of rows.
triangle(0) → 0
triangle(1) → 1
triangle(2) → 3
how to decide base case begin with 0Just do the same with base case with 0 instead of 1.
public int triangle(int rows) {
if(rows==0){
return 0;
}
return rows+triangle(rows-1);
}
Open in new window
above fails one test casehow to decide base case begin with 0 or with 1. it is failing 0 case now