Triple Step java 走地牙 8.1 CTCI

Triple Step: A child is running up a staircase with n steps and can hop either 1 step, 2 steps, or 3 steps at a time. Implement a method to count how many possible ways the child can run up the stairs.

//dynamic programming
class Solution {
    public int climbStairs(int n) {
        int[] memo = new int[n + 1];
        if(n <= 2) {
            return n;
        }

        memo[0] = 1;
        memo[1] = 1;
        memo[2] = 2;
        for(int i = 3; i <= n; i++) {
            memo[i] = memo[i - 1] + memo[i - 2] + memo[i - 3];
        }
        return memo[n];
    }
}