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 | 519 Views, 22951 Search Bots | 74 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 519 Views, 22951 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 | 519 Views, 22951 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
- Longest Substring Without Repeating Characters
- Spreadsheet Column Title
- Multitasking
- Maximum In A Stack
- Most Frequent Subtree Sum
- Daily Interview Problem: Reverse Integer
- Algorithm Interview: Level Order Traversal of Binary Tree
- Making a Height Balanced Binary Search Tree
- Absolute Path
- Daily Interview Problem: Merge List Of Number Into Ranges
©2006~2024 SteakOverCooked - 0.01015 Seconds(s) - 1871.408 KB/s - 33 Online Memory: 492.5 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 !