首页 > 其他 > 详细

[4Clojure]解题记录-#79

时间:2014-12-01 22:07:53      阅读:303      评论:0      收藏:0      [点我收藏+]
Triangle Minimal Path
 

Difficulty: Hard
Topics: graph-theory

 

Write a function which calculates the sum of the minimal path through a triangle. The triangle is represented as a collection of vectors. The path should start at the top of the triangle and move to an adjacent number on the next row until the bottom of the triangle is reached.
 
(= 7 (__ ‘([1]
              [2 4]
             [5 1 4]
            [2 3 4 5]))) ; 1->2->1->3
 
(= 20 (__ ‘([3]
                [2 4]
               [1 9 3]
              [9 9 2 4]
             [4 6 6 7 8]
            [5 7 3 5 1 4]))) ; 3->4->3->2->7->1
 
解长度:65
(fn [s](last (reduce #(map + (map min (rest %)(butlast %)) %2) (reverses))))

[4Clojure]解题记录-#79

原文:http://www.cnblogs.com/zjfu/p/4135914.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!