package chapter2; /* * 迭代计算第n个Fibonacci数 * 输入:一个非负整数n * 输出:第n个Fibonacci数 */ import java.util.*; import java.io.*; public class Fib { static int n; static int Fibonacci; static void Init(){ Scanner in = new Scanner(System.in); System.out.println("请输入一个非负整数n:"); n = in.nextInt(); } static int F(){ if(n<=1){ return n; } else{ int f0 = 0; int f1 = 1; for(int i=2;i<=n;i++){ Fibonacci = f0+f1; f0 = f1; f1 = Fibonacci; } return Fibonacci; } } public static void main(String[] args) throws IOException{ boolean tag = false; do{ Init(); System.out.println("Fibonacci数为:"+F()); System.out.println("/n是否继续?请输入(y/n):"); Scanner in = new Scanner(System.in); String continueOrNot = in.nextLine(); if(continueOrNot.equalsIgnoreCase("y")){ tag = true; } else{ tag = false; } }while(tag); } }