题解 | #贪吃牛# Java

动态规划入门题，其实就是斐波那契数列，青蛙跳台阶

import java.util.*;


public class Solution {

    public int eatGrass (int n) {
        if (n <= 2) return n;
        else return eatGrass(n - 1) + eatGrass(n - 2);
    }
}

不用动态规划可以时间复杂度好一点

import java.util.*;


public class Solution {

    public int eatGrass (int n) {
        int a = 1;
        int b = 1;
        for (int i = 2; i <= n; i++) {
            int temp = a + b;
            a = b;
            b = temp;
        }
        return b;
    }
}