斐波那契數列

 /**輸出斐波那契數列第n項 --- 遞歸*/

public class Solution{
public int Fibonacci(int n) {
        if (n == 0) {
            return 0;
        }
        if (n == 1) {
            return 1;
        }
        return Fibonacci(n - 2) + Fibonacci(n - 1);
    }
}

/**輸出斐波那契數列第n項 --- 非遞歸*/

public class Solution {
public int Fibonacci2(int n) {
        int[] res = {0,1};
        int x = 0;
        if (n < 2) {
            return res[n];
        }
        int one = res[0];
        int two = res[1];
        for (int i = 2; i <= n; i++) {
            x = one + two;
            one = two;
            two = x;
        }
        return x;
    }
}