斐波那契数列

 1 import java.util.Scanner;
 2 public class Solution {
 3     public int Fibonacci(int n) {
 4         int first = 0;
 5         int last = 1;
 6         int temp = 0;
 7         if(n == 0)
 8             return first;
 9         if(n == 1)
10             return last;
11         for(int i = 2; i <= n; i++){
12             temp=first+last;
13             first = last;
14             last = temp;
15         }
16         return last;
17     }
18     
19     public static void main(String[] args){
20         Scanner scanner = new Scanner(System.in);
21         Solution solution = new Solution();
22         int x = scanner.nextInt();
23         System.out.println(solution.Fibonacci(x));
24     }
25 }

 1 public class Solution {
 2     /*
 3      * @param n: an integer
 4      * @return: an ineger f(n)
 5      */
 6         int[] a = new int[50];
 7     public int fibonacci(int n) {
 8         
 9         if(n<=2)
10         return n-1;
11         if(a[n]!=0)
12         return a[n];
13         else
14         return a[n]=fibonacci(n-1)+fibonacci(n-2);
15     }
16 }