当前位置： 移动技术网 > IT编程>开发语言>C/C++ > LeetCode - 70. Climbing Stairs(0ms)

LeetCode - 70. Climbing Stairs(0ms)

2018年08月02日  | 移动技术网IT编程  | 我要评论

白博美,退避三舍的故事,股市开盘时间和收盘时间

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?

Note: Given n will be a positive integer.

Example 1:

Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps

Example 2:

Input: 3
Output: 3
Explanation: There are three ways to climb to the top.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step
 1 class Solution {
 2 public:
 3     int climbStairs(int n) {
 4         if(n == 1)
 5             return 1;
 6         
 7         int res[n + 1];
 8         res[0] = 1;
 9         res[1] = 1;
10         for(int i = 2; i <= n; i++)
11             res[i] = res[i - 1] + res[i - 2];
12         return res[n];
13     }
14 };

 

您可能感兴趣的文章:

如对本文有疑问，请在下面进行留言讨论，广大热心网友会与你互动！！ 点击进行留言回复

相关文章:

验证码：
最近更新的文章
大家感兴趣的文章
移动技术网