daviddoji/project-euler
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add statement

Browse Source
This commit is contained in:
David Doblas Jiménez 2021-08-03 11:31:54 +02:00
parent 122c835b8a
commit fca345556b
1 changed files with 16 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
src/Julia/Problem018.jl
View File

@ -5,13 +5,21 @@ Created on 01 Aug 2021
@email: daviddoji@pm.me @email: daviddoji@pm.me
Solution for Problem 18 of Project Euler Solution for Problem 18 of Project Euler
https://projecteuler.net/problem=18 https://projecteuler.net/problem=18 =#
=#
function Problem18() function Problem18()
#= #=
Statement By starting at the top of the triangle below and moving to adjacent
=# numbers on the row below, the maximum total from top to bottom is 23.
3
7 4
2 4 6
8 5 9 3
That is, 3 + 7 + 4 + 9 = 23.
Find the maximum total from top to bottom of the triangle above =#
triangle = [ # Mutable triangle = [ # Mutable
[75], [75],
[95,64], [95,64],
@ -27,11 +35,11 @@ function Problem18()
[70,11,33,28,77,73,17,78,39,68,17,57], [70,11,33,28,77,73,17,78,39,68,17,57],
[91,71,52,38,17,14,91,43,58,50,27,29,48], [91,71,52,38,17,14,91,43,58,50,27,29,48],
[63,66, 4,68,89,53,67,30,73,16,69,87,40,31], [63,66, 4,68,89,53,67,30,73,16,69,87,40,31],
[ 4,62,98,27,23, 9,70,98,73,93,38,53,60, 4,23], [4,62,98,27,23, 9,70,98,73,93,38,53,60, 4,23],
] ]
len_triangle = length(triangle) len_triangle = length(triangle)
for i in len_triangle-1:-1:1 for i in len_triangle - 1:-1:1
for j in 1:length(triangle[i]) for j in 1:length(triangle[i])
triangle[i][j] += max(triangle[i + 1][j], triangle[i + 1][j + 1]) triangle[i][j] += max(triangle[i + 1][j], triangle[i + 1][j + 1])
end end