Anonymous user
Maximum triangle path sum: Difference between revisions
Not a draft any more
(→{{header|Ruby}}: Added Ruby entry.) |
(Not a draft any more) |
||
Line 7:
One of such walks is 55 - 94 - 30 - 26. You can compute the total of the numbers you have seen in such walk, in this case it's 205.
Your problem is to find the maximum total among all possible paths from the top to the bottom row of the triangle. In the little example above it's 321.
| |||