Created
December 17, 2011 15:49
-
-
Save rrees/1490542 to your computer and use it in GitHub Desktop.
Clojure code to solve largest increasing sequence 4Clojure problem
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
(fn | |
([seq] (find-inc-seq [] [] seq)) | |
([cur-seq cur-longest-seq a-seq] | |
(cond | |
(empty? a-seq) | |
(let [ret (if (> (count cur-seq) (count cur-longest-seq)) cur-seq cur-longest-seq)] | |
(if (> (count ret) 1) ret [])) | |
(empty? cur-seq) (find-inc-seq (conj [] (first a-seq)) cur-longest-seq (rest a-seq)) | |
:default (if (> (first a-seq) (last cur-seq)) | |
(find-inc-seq | |
(conj cur-seq (first a-seq)) | |
cur-longest-seq | |
(rest a-seq)) | |
(find-inc-seq | |
[] | |
(if (> (count cur-seq) (count cur-longest-seq)) cur-seq cur-longest-seq) | |
a-seq))))) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment