gistfile1.clj

;; for 18 and 67 in project euler
(defn max-path-sum
  "give it a vector of vectors that form a triangle"
  ([t] (max-path-sum t (- (count t) 2) (t (dec (count t)))))
  ([t top bot]
     (if (> top 0)
       (max-path-sum
        t
        (dec top)
        (vec
         (let [row (t top)]
           (for [i (range top)]
             (+ (row i) (max (bot i) (bot (inc i))))))))
       (+ (bot 0) ((t top) 0)))))