随笔分类 -  趣味编程

Fibonacci数列Java实现
摘要：Fibonacci数列：如是：[1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89] f(0) = 1; f(1) = 1; f(n) = f(n-1)+f(n-2) n>1; 阅读全文
posted @ 2016-07-14 20:37 胡杨三千 阅读(3492) 评论(0) 推荐(0)