mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
bc8df6de31
* [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.2.2 → v0.3.2](https://github.com/astral-sh/ruff-pre-commit/compare/v0.2.2...v0.3.2) - [github.com/pre-commit/mirrors-mypy: v1.8.0 → v1.9.0](https://github.com/pre-commit/mirrors-mypy/compare/v1.8.0...v1.9.0) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
41 lines
1.0 KiB
Python
41 lines
1.0 KiB
Python
"""
|
|
Problem 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 in triangle.txt (right click and
|
|
'Save Link/Target As...'), a 15K text file containing a triangle with
|
|
one-hundred rows.
|
|
"""
|
|
|
|
import os
|
|
|
|
|
|
def solution() -> int:
|
|
"""
|
|
Finds the maximum total in a triangle as described by the problem statement
|
|
above.
|
|
>>> solution()
|
|
7273
|
|
"""
|
|
script_dir = os.path.dirname(os.path.realpath(__file__))
|
|
triangle_path = os.path.join(script_dir, "triangle.txt")
|
|
|
|
with open(triangle_path) as in_file:
|
|
triangle = [[int(i) for i in line.split()] for line in in_file]
|
|
|
|
while len(triangle) != 1:
|
|
last_row = triangle.pop()
|
|
curr_row = triangle[-1]
|
|
for j in range(len(last_row) - 1):
|
|
curr_row[j] += max(last_row[j], last_row[j + 1])
|
|
return triangle[0][0]
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(solution())
|