42. leetcode 70. Climbing Stairs

70. 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?

Note: Given n will be a positive integer.

思路:到第n个台阶的迈法种数=到第n-1个台阶的迈法种数(再往上迈一步)+到第n-2个台阶的迈法种数(再往上迈两步)。斐波那契数列的问题。

42. leetcode 70. Climbing Stairs

上一篇:iOS开发-编译出错 duplicate symbols for architecture x86_64


下一篇:C# Winform 实现自定义半透明遮罩层介绍