Java算法1-- 階乘和斐波那契數列

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);
    }

}