File: root - text - article - 2019 - 10 - number-of-ways-to-climb-stairs.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 239 Views, 17783 Search Bots | 74 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 239 Views, 17783 Search Bots | 74 Words
| Browse | Archive
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?
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Cateogry: Computing | 239 Views, 17783 Search Bots | 74 Words 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?
Related Articles
- Maximum In A Stack
- Two-Sum
- Algorithm Interview Question: Nth Fibonacci Number
- [Daily Problem] Longest Increasing Subsequence
- Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
- [Daily Problem] Remove Consecutive Nodes that Sum to 0
- Design Tic-Tac-Toe
- Detect Linked List Cycle
- Binary Tree Level with Minimum Sum
- Find the non-duplicate number
©2006~2024 SteakOverCooked - 0.03776 Seconds(s) - 497.761 KB/s - 60 Online Memory: 493.16 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !