509. Fibonacci Number [Easy]

/**
 * 每一项等于前两项的和，动态规划
 * 用a、b两个变量分别保存和更新前两项的值，就可以省去动态规划数组
 * Runtime: 0 ms, faster than 100.00%
 * Memory Usage: 35.5 MB, less than 67.00%
 */
class Solution {
    public int fib(int n) {
        if (n < 2) {
            return n;
        }
        int a = 0, b = 1, res = 0;
        while (n-- >= 2) {
            res = a + b;
            a = b;
            b = res;
        }
        return res;
    }
}

/**
 * 用动态规划数组的做法
 * Runtime: 0 ms, faster than 100.00%
 * Memory Usage: 35.7 MB, less than 33.08%
 */
class Solution {
    public int fib(int n) {
        if (n < 2) {
            return n;
        }
        int[] dp = new int[n + 1];
        dp[0] = 0;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }
        return dp[n];
    }
}