codility: Fibonacci numbers (FibFrog, Ladder)
摘要：
FibFrog:The Fibonacci sequence is defined using the following recursive formula: F(0) = 0 F(1) = 1 F(M) = F(M - 1) + F(M - 2) if M >= 2A small frog wants to get to the other side of a river. The frog is initially located at one bank of the river (position −1) and wants to get to the other b... 阅读全文
posted @ 2014-04-08 10:17 parapax 阅读(2062) 评论(0) 推荐(0) 编辑