feat(solution): problem #18

solutions/018/maxpathsum1.py

@@ -0,0 +1,25 @@
+dataTable = [
+    [75],
+    [95, 64],
+    [17, 47, 82],
+    [18, 35, 87, 10],
+    [20,  4, 82, 47, 65],
+    [19,  1, 23, 75,  3, 34],
+    [88,  2, 77, 73,  7, 63, 67],
+    [99, 65,  4, 28,  6, 16, 70, 92],
+    [41, 41, 26, 56, 83, 40, 80, 70, 33],
+    [41, 48, 72, 33, 47, 32, 37, 16, 94, 29],
+    [53, 71, 44, 65, 25, 43, 91, 52, 97, 51, 14],
+    [70, 11, 33, 28, 77, 73, 17, 78, 39, 68, 17, 57],
+    [91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29, 48],
+    [63, 66,  4, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31],
+    [ 4, 62, 98, 27, 23,  9, 70, 98, 73, 93, 38, 53, 60,  4, 23],
+]
+
+# traverse the triangle from the second-to-bottom row, upwards
+for i in reversed(range(len(dataTable) - 1)):
+    for j in range(i + 1):
+        # set the value of the current node to be the higher sum of the two possible children
+        dataTable[i][j] += max(dataTable[i + 1][j], dataTable[i + 1][j + 1])
+
+print("The maximum sum from top to bottom of the triangle is: ", str(dataTable[0][0]))