More descriptive problem description

This commit is contained in:
2020-04-09 03:10:47 +02:00
parent c5c7fb93c1
commit 411690914c

View File

@@ -3,7 +3,8 @@ import math
import numpy as np
# Find the maximum path sum of the triangle below
# Find the maximum path sum of the triangle below, if you follow a path that
# starts at the top and goes down, choosing one of either value below you
# 75