search

andrew-field / projecteuler-go

Testing and practising Go with Project Euler
MIT License
0 stars 0 forks source link

Challenge 67: Maximum path sum II #25

Closed andrew-field closed 5 years ago

andrew-field commented 5 years ago

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 in triangle.txt (right click and 'Save Link/Target As...'), a 15K text file containing a triangle with one-hundred rows.

NOTE: This is a much more difficult version of Problem 18.

andrew-field commented 5 years ago

Updated to have a second method to use a recursive functions. This method is not as good as the first method and takes too long to complete.

andrew-field commented 3 years ago

Updated due to the refactor and also just reads the whole file into memory instead of many small reads.