package com.yenange.test2; 
import java.util.Scanner; 
public class Fibonacci { 
  private static Scanner input = new Scanner(System.in); 
  public static void main(String[] args) { 
    System.out.println("-----------第1种算法------------"); 
    int num1 = 1; 
    int num2 = 1; 
    int temp, count; 
    System.out.println("请输入要查询的是第几个数(>=2):"); 
    count = input.nextInt();
    System.out.println("第1个数是:1"); 
    System.out.println("第2个数是:1"); 
    for (int i = 3; i <= count; i++) { 
      temp = num2; 
      num2 += num1; 
      System.out.println("第" + i + "个数是:" + num2); 
      num1 = temp; 
    }
    System.out.println("-----------第2种算法------------"); 
    System.out.println("第" + count + "个数是:" + cal(count));
    System.out.println("-----------第3种算法------------"); 
    int[] arr = new int[count]; 
    arr[0] = 1; 
    arr[1] = 1; 
    for (int i = 2; i < arr.length; i++) { 
      arr[i] = arr[i - 1] + arr[i - 2]; 
      System.out.println("第" + (i + 1) + "个数是:" + arr[i]); 
    } 
  }
  static int cal(int count) { 
    if (count <= 2) { 
      return 1; 
    } 
    return cal(count - 1) + cal(count - 2); 
  } 
}