70. Climbing Stairs（LeetCode）

最新推荐文章于 2024-01-18 13:59:59 发布

weixin_30763455

最新推荐文章于 2024-01-18 13:59:59 发布

阅读量62

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/wujufengyun/p/6894463.html

本文探讨了经典的爬楼梯问题，即如何用不同方式爬到楼梯顶部的问题。使用递推算法来解决这个问题，并通过示例代码详细展示了实现过程。

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.

 1 class Solution {
 2 public:
 3     int climbStairs(int n) {
 4       int sum = 0;
 5         if (n <= 1)
 6             return 1;
 7         if (n == 2)
 8             return 2;
 9         int a = 1, b = 2;
10         for (int i = 3; i <= n; i++)
11         {
12             sum = a + b;
13             a = b;
14             b = sum;
15             sum=0;
16         }
17         return b;
18     }
19 };