LeetCode Climbing Stairs 70

70. Climbing Stairs

My Submissions

QuestionEditorial Solution

Total Accepted: 103589 Total Submissions: 283139 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?

最简单的DP

public class Solution {    public int climbStairs(int n) {        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];    }}