LeetCode-70. Climbing Stairs

LeetCode-70. Climbing Stairs

​​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: 2Output: 2Explanation: There are two ways to climb to the top.1. 1 step + 1 step2. 2 steps

Example 2:

Input: 3Output: 3Explanation: There are three ways to climb to the top.1. 1 step + 1 step + 1 step2. 1 step + 2 steps3. 2 steps + 1 step

题解：简单动态规划

class Solution {public: int climbStairs(int n) { vector dp; dp.push_back(1); dp.push_back(2); for (int i = 2; i <= n; i++){ dp.push_back(dp[i - 1] + dp[i - 2]); } return dp[n - 1]; }};

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。