public class Solution { public int climbStairs(int n) { //04:10 int [] climbWays = new int[n+1]; if(n == 0) return 0; if(n == 1) return 1; climbWays[1] = 1; climbWays[2] = 2; for(int i = 3; i <= n; i++){ climbWays[i] = climbWays[i⑴] + climbWays[i⑵]; } return climbWays[n]; } //04:14 }