Climbing Stairs, climbingstairs

Climbing Stairs, climbingstairs

You are climbing a stair case. It takesNSteps 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?

When recursive to n = 44, it will time out and calculate the n-step sub-crawling Based on the feona-cut sequence is the sum of N-1 and N-2 step sub

1 int climbStairs (int n) {2 int a = 1; 3 int B = 2; 4 int I, c; 5 if (1 = n) 6 return 1; 7 if (2 = n) 8 return 2; 9 for (I = 2; I <n; I ++) 10 {11 c = a + B; 12 a = B; 13 B = c; 14} 15 return c; 16}