代码面试题：Fibonacci Numbers

最新推荐文章于 2024-07-06 10:30:02 发布

店小不2

最新推荐文章于 2024-07-06 10:30:02 发布

阅读量1k

点赞数

CC 4.0 BY-SA版权

分类专栏： coding interview 文章标签：面试题

本文链接：https://blog.youkuaiyun.com/xiaoxixixiyang/article/details/39432185

coding interview 专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一个简单的Java程序，用于生成斐波那契数列。该程序通过一个公共静态方法实现，接受一个整数参数并返回相应长度的斐波那契数列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

In mathematics, the Fibonacci numbers or Fibonacci series or Fibonacci sequence are the numbers in the following integer sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144... By definition, the first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two.

    public static ArrayList<Integer> fibonacci(int num) {
    	ArrayList<Integer> res = new ArrayList<Integer>();
    	if (num == 0) {
    		return res;
    	}
    	int first = 0;
    	int second = 1;
    	if (num == 1) {
    		res.add(first);
    	} else {
    		res.add(first);
    		res.add(second);
    	} 
    	
    	for (int i = 1; i <= num - 2; i++) {
    		int third = first + second;
    		res.add(third);
    		first = second;
    		second = third;
    	}
    	return res;
    }