1
0
mirror of https://github.com/janet-lang/janet synced 2024-12-11 17:20:26 +00:00
janet/examples/maxtriangle.janet
2019-03-21 14:32:08 -04:00

22 lines
409 B
Plaintext

# Find the maximum path from the top (root)
# of the triangle to the leaves of the triangle.
(defn myfold [xs ys]
(let [m1 (map + [;xs 0] ys)
m2 (map + [0 ;xs] ys)]
(map max m1 m2)))
(defn maxpath [t]
(extreme > (reduce myfold () t)))
# Test it
# Maximum path is 3 -> 10 -> 3 -> 9 for a total of 25
(def triangle
'[[3]
[7 10]
[4 3 7]
[8 9 1 3]])
(print (maxpath triangle))