Climbing Stairs II

最新推荐文章于 2020-01-22 20:54:50 发布

ncst

最新推荐文章于 2020-01-22 20:54:50 发布

阅读量248

点赞数

分类专栏： leetcode 文章标签：标签 path class

本文链接：https://blog.csdn.net/sinat_32547403/article/details/78670526

版权

leetcode 专栏收录该内容

414 篇文章 1 订阅

订阅专栏

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.

Have you met this question in a real interview?

Yes

Example

n=3
1+1+1=2+1=1+2=3=3

这个题目是爬梯子的follow up类型的题目，只需要在初始化的时候，初始化化3个变量即可

java

public class Solution {
    /*
     * @param n: An integer
     * @return: An integer
     */
    public int climbStairs2(int n) {
        // write your code here
        if (n < 0) {
            return 0;
        }
        if (n == 0) {
            return 1;
        }
        if (n >= 1 && n <= 2) {
            return n;
        }
        if (n == 3) {
            return 4;
        }
        int[] f = new int[n + 1];
        f[0] = 1; f[1] = 1; f[2] = 2; f[3] = 4;
        for (int i = 4; i <= n; i++) {
            f[i] = f[i - 1] + f[i - 2] + f[i - 3];
        }
        return f[n];
    }
};

python

class Solution:
    """
    @param: n: An integer
    @return: An integer
    """
    def climbStairs2(self, n):
        # write your code here
        if n < 0:
            return 0
        if n == 0 or n == 1:
            return 1
        if n == 2:
            return 2
        if n == 3:
            return 4
        f = [0] * (n + 1)
        f[0], f[1], f[2], f[3] = 1, 1, 2, 4
        for i in range(4, n + 1):
            f[i] = f[i - 1] + f[i - 2] + f[i - 3]
        return f[n]