Maximum triangle path sum: Difference between revisions
Content deleted Content added
No edit summary |
|||
| Line 119: | Line 119: | ||
for( int i = 2; i <= n; i++ ) |
for( int i = 2; i <= n; i++ ) |
||
{ |
{ |
||
triangle[last - n] = triangle[last - n] + std::max(triangle[last - 1], triangle[last]); |
triangle[last - n] = triangle[last - n] + std::max( triangle[last - 1], triangle[last] ); |
||
last--; |
last--; |
||
} |
} |
||