常见算法-斐波那契数列

最新推荐文章于 2024-10-19 11:17:13 发布

Zhao1iang

最新推荐文章于 2024-10-19 11:17:13 发布

阅读量193

点赞数

文章标签：算法 leetcode java

本文链接：https://blog.csdn.net/sinat_40968110/article/details/109898103

版权

package common;

/**
 * @author : zhaoliang
 * @program :newCoder
 * @description : 斐波那契数列
 * @create : 2020/11/21 14:20
 */
public class Fibonacci {
    //输入一个整数n,求输出的斐波那契数列的第n项
    public static int fibonacci(int n){
        if (n <=0){
            return 0;
        }
        if (n <=2){
            return 1;
        }
        int first=1,second=1,third=2;
        for (int i = 3; i <=n ; i++) {
            third = first+second;
            first = second;
            second = third;
        }
        return third;
    }

    public static void main(String[] args) {
        System.out.println(fibonacci(3));
    }
}