LeetCode-in-Net/LeetCodeNet/G0001_0100/S0070_climbing_stairs/Solution.cs at main · jscrdev/LeetCode-in-Net · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
namespace LeetCodeNet.G0001_0100.S0070_climbing_stairs {

// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math #Memoization
// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_2
// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
// #Big_O_Time_O(n)_Space_O(n) #2025_06_13_Time_0_ms_(100.00%)_Space_29.08_MB_(56.18%)

public class Solution {

    [System.Diagnostics.CodeAnalysis.SuppressMessage("Performance", "CA1822", Justification = "LeetCode")]
    public int ClimbStairs(int n) {
        int[] dp = new int[n + 1];
        dp[0] = 1;
        for (int i = 0; i < dp.Length; i++) {
            if (i + 1 < dp.Length) {
                dp[i + 1] += dp[i];
            }
            if (i + 2 < dp.Length) {
                dp[i + 2] += dp[i];
            }
        }
        return dp[dp.Length - 1];
    }
}
}