Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

class Solution { public: int climbStairs(int n) { int sum[n]; sum[0]=1;sum[1]=2;sum[2]=3; for(int i=3;i<n;i++){ sum[i]=sum[i-3]+sum[i-2]*2; } return sum[n-1]; } };

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.