文件: root - text - article - 2019 - 10 - number-of-ways-to-climb-stairs.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 439 次阅读, 21363 次搜索 | 74 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 439 次阅读, 21363 次搜索 | 74 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by LinkedIn:
You are given a positive integer N which represents the number of steps in a staircase. You can either climb 1 or 2 steps at a time. Write a function that returns the number of unique ways to climb the stairs.
Can you find a solution in O(n) time?
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 439 次阅读, 21363 次搜索 | 74 个单词 You are given a positive integer N which represents the number of steps in a staircase. You can either climb 1 or 2 steps at a time. Write a function that returns the number of unique ways to climb the stairs.
def staircase(n):
# Fill this in.
print staircase(4)
# 5
print staircase(5)
# 8
Can you find a solution in O(n) time?
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- YES!!
- ImageMagick Vulnerabilities - CVE-2016–3714
- [Daily Problem] Add two numbers as a linked list
- PHP Unit Tests on VPS Server
- Daily Interview Problem: Full Binary Tree
- Find Missing Numbers in an Array
- Daily Interview Problem: Largest Product of 3 Elements I
- Algorithm Interview: Maximum Path Sum in Binary Tree
- Algorithm Interview: Level Order Traversal of Binary Tree
- First and Last Indices of an Element in a Sorted Array
©2006~2024 牛排过熟 - 0.00768 秒 - 2571.119 KB/s - 115 在线
内存: 493.41 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="索引, 跟踪">
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。