100277. 跳跃训练

难度: Easy

题目描述

English description is not available for the problem. Please switch to Chinese.

解题思路

代码实现

解决方案

java

class Solution {
    public int trainWays(int num) {
        if (num == 0) {
            return 1;
        }
        if (num == 1) {
            return 1;
        }
        if (num == 2) {
            return 2;
        }
        int mod = 1000000007;
        int first = 1;
        int second = 2;
        for (int i = 3; i <= num; i++) {
            int temp = first + second;
            temp = temp % mod;
            first = second;
            second = temp;
        }
        return second;
    }
}