Problem: Write a function to calculate fibonacci number in constant space complexity.
(defn fib [n]
(loop [a 0
b 1
i n]
(if (= 0 i)
a
(recur b (+ a b) (dec i)))))
Guowei Lv
吕国威的博客
Thinker · Writer · Coder · Painter
-
sicp 44 -
android-development 32 -
android-custom-view-102 19 -
goos-book-distilled 17 -
jetpack-compose 16 -
programming-kata 15 -
android-+-dagger2 14 -
finnish-learning 10 -
thoughts 10 -
object-oriented-design 8 -
functional-programming 7 -
javascript 7 -
music 7 -
books 6 -
clojure 6 -
android-custom-view-101 5 -
c-programming 5 -
design-and-architecture 5 -
emacs 5 -
hand-made-hero 5 -
java 4 -
kotlin 4 -
android-library 3 -
painting 3 -
refactoring 3 -
concurrent-programming 2 -
other 2 -
pointfree 2 -
test-driven-development 2 -
videos 2 -
azure 1 -
c64 1 -
calligraphy 1 -
common-lisp 1 -
english-learning 1 -
game 1 -
htmlcss 1 -
interesting-finds 1 -
machine-learning 1 -
machine-learning-books 1 -
machine-learning-courses 1 -
mech-keyboard 1 -
perfume 1 -
programming-misc 1 -
python 1 -
react 1 -
reading 1 -
statistics 1 -
tdd 1 -
travel 1 -
wallpapers 1
Categories
About
Welcome to my personal website. In here, I talk about programming in general and other cool stuff. Stay tuned!
Share this post
Twitter
Google+
Facebook
Reddit
LinkedIn
StumbleUpon
Email