习题2.35

2.35早早完成了，一直攒着想喝2.34一起发。先贴代码，再讲讲自己折腾的时候遇到的问题。

;;旧版
(defn count-leaves [x]
  (cond
        (not (seq? x))  1
        (empty? x) 0
        :else (+ (count-leaves (first x)) (count-leaves (rest x)) )
        )

  )
;;新版
(def x (cons (list 1 2) (list 3 4)))
(def x (cons (list 1 (list 2 6 7)) (list 3 (list 4 5))))

(defn cons2[x y](cond (not (seq? x)) (cons x y) (empty? x) y :else (concat (cons2 (first x)  (cons2 (rest x) y)))))

(defn map2 [p sequences]
  (accumulate (fn [x y] (if (= x nil) nil (p x y) ) ) nil sequences)
)

(defn count-leaves2 [x]
  (accumulate (fn [x y] (+ y 1))  0 (map2 cons2  x )))
</