Java算法1-- 阶乘和斐波那契数列

来源：互联网发布：西游记源码编辑：程序博客网时间：2024/06/05 21:15

1、阶乘

package suanfa;import java.util.Scanner;public class Factorial {    @SuppressWarnings("resource")    public static void main(String[] agrs)    {        System.out.println("请输入阶乘数：");        Scanner s=new Scanner(System.in);        int n=s.nextInt();        System.out.println(n+"阶乘为：");            System.out.print(factorial(n));    }    private static double factorial(int n)    {        if(n==0) return 1;        return n*factorial(n-1);    }}

2、斐波那契数列

package suanfa;import java.util.Scanner;public class Fibonacci {    @SuppressWarnings("resource")    public static void main(String[] agrs)    {        int index=0;        System.out.println("请输入斐波那契数列项数：");        Scanner s=new Scanner(System.in);        int n=s.nextInt();        System.out.println("您想输出"+n+"个斐波那契数列为：");        while(index<n)        {            System.out.print(fibonacci(index++));            System.out.print("  ");        }    }    private static int fibonacci(int n)    {        if(n<=1) return 1;        return fibonacci(n-1)+fibonacci(n-2);    }}

1 0