Skip to main content

need help with RECURSION?

1 reply [Last post]
sxxghost
Offline
Joined: 2009-03-15
Points: 0

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

LINK:
http://www.javabat.com/prob/p194781

Reply viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.
kcorrc
Offline
Joined: 2009-03-17
Points: 0

public int triangle(int rows) {
if ( rows == 0)
return 0;

else
return rows + triangle(rows-1);
}

there ya go :)