2018-03-26 01:12:43 +00:00
|
|
|
# Find the maximum path from the top (root)
|
|
|
|
|
# of the triangle to the leaves of the triangle.
|
2018-08-23 01:41:25 +00:00
|
|
|
|
2018-03-25 22:51:31 +00:00
|
|
|
(defn myfold [xs ys]
|
2019-03-21 18:32:08 +00:00
|
|
|
(let [m1 (map + [;xs 0] ys)
|
|
|
|
|
m2 (map + [0 ;xs] ys)]
|
2018-05-08 23:40:28 +00:00
|
|
|
(map max m1 m2)))
|
2018-03-25 22:51:31 +00:00
|
|
|
|
|
|
|
|
(defn maxpath [t]
|
2018-08-23 01:41:25 +00:00
|
|
|
(extreme > (reduce myfold () t)))
|
2018-04-01 19:08:51 +00:00
|
|
|
|
|
|
|
|
# Test it
|
|
|
|
|
# Maximum path is 3 -> 10 -> 3 -> 9 for a total of 25
|
2018-03-25 22:51:31 +00:00
|
|
|
|
2018-08-23 01:41:25 +00:00
|
|
|
(def triangle
|
|
|
|
|
'[[3]
|
|
|
|
|
[7 10]
|
|
|
|
|
[4 3 7]
|
2018-11-27 03:09:12 +00:00
|
|
|
[8 9 1 3]])
|
2018-03-25 22:51:31 +00:00
|
|
|
|
|
|
|
|
(print (maxpath triangle))
|
