首页 > itarticle > leetcode 70. climbing stairs

leetcode 70. climbing stairs

admin 11月 13, 2020 0

70. Climbing Stairs

Difficulty:: Easy

You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Note: Given n will be a positive integer.

Example 1:

1
2
3
4
5
 
Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps

Example 2:

1
2
3
4
5
6
 
Input: 3
Output: 3
Explanation: There are three ways to climb to the top.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step

Solution

Language: Java

1
2
3
4
5
6
7
8
9
10
11
12
 
class  {
    public int climbStairs(int n) {
        int result = 0;
        int a = 0, b = 1;
        for (int i = 0; i < n; i++) {
            result = a + b;
            a = b;
            b = result;
        }
        return result;
    }
}
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
 
class  {
    public int climbStairs(int n) {
        if (n <= 0) {
            return 1;
        }
        int[] dp = new int[n + 1];
        dp[0] = 1;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }
        return dp[n];
    }
}
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能