java实现斐波那契数列，现在要求输入一个整数n，请你输出斐波那契数列的第n项。 n public class Solution_feibonaqi { public int Fibonacci(int n) { int result[] = { 0, 1 }; if (n < 2) { return result[n]; } int f0 = 0; int f1 = 1; int f2 = 0; for (int i = 2; i <= n; i++) { f2 = f1 + f0; f0 = f1; f1 = f2; } return f2; } public static void main(String[] args) { Scanner sc = new Scanner; int n = ; Solution_feibonaqi fei = new S

public class Solution_feibonaqi
{

	public int Fibonacci(int n)
	{
		int result[] =
		{ 0, 1 };
		if (n < 2)
		{
			return result[n];
		}
		int f0 = 0;
		int f1 = 1;
		int f2 = 0;
		for (int i = 2; i <= n; i++)
		{
			f2 = f1 + f0;
			f0 = f1;
			f1 = f2;
		}
		return f2;
	}

	public static void main(String[] args)
	{
		Scanner sc = new Scanner();
		int n = ();
		Solution_feibonaqi fei = new Solution_feibonaqi();
		((n));
	}

}