More descriptive problem description
This commit is contained in:
@@ -3,7 +3,8 @@ import math
|
|||||||
import numpy as np
|
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
|
# 75
|
||||||
|
|||||||
Reference in New Issue
Block a user