Anderssorby · July 7, 2016 14:10
diff --git a/Longest Increasing Sub-Seq b/Longest Increasing Sub-Seq
 ;; 4clojure problem #53
 (fn [s] (loop [longest [] r (sorted-set) [x n & xs :as l] s]
          (cond 
           (nil? n) longest
           (= n (inc x)) (recur (if (> (+ 2 (count r)) (count longest)) (vec (conj r x n)) longest) (conj r x n) (rest l))
           :else (recur longest (sorted-set) (rest l)))))
	;; 4clojure problem #53
	(fn [s] (loop [longest [] r (sorted-set) [x n & xs :as l] s]
	(cond
	(nil? n) longest
	(= n (inc x)) (recur (if (> (+ 2 (count r)) (count longest)) (vec (conj r x n)) longest) (conj r x n) (rest l))
	:else (recur longest (sorted-set) (rest l)))))