Maximum path sum II: https://projecteuler.net/problem=67

max-path-sum.py

#!/usr/bin/python3

from typing import TextIO


try:
    triangle: TextIO = open('triangle.txt')
    tree = [[int(s) for s in line.split()]
            for line in [line.rstrip() for line in triangle.readlines()]]

    for r in range(len(tree) - 1, 0, -1):
        for c in range(0, r):
            if tree[r][c] > tree[r][c + 1]:
                tree[r - 1][c] += tree[r][c]
            else:
                tree[r - 1][c] += tree[r][c + 1]

    print(tree[0][0])
finally:
    triangle.close()