Climbing Stairs

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?

01 class Solution {
02 public:
03     int climbStairs(int n) {
04         // Start typing your C/C++ solution below
05         // DO NOT write int main() function
06         vector<int> A(n);
07         A[0]=1;
08         A[1]=2;
09         for(int i=2;i<n;i++)
10         {
11             A[i]=A[i1]+A[i2];
12         }
13         return A[n1];
14     }
15 };
This entry was posted in Array and linked list, Dynamic programming. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s