文件: root - text - article - 2020 - 01 - nth-fibonacci-number.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 464 次阅读, 23801 次搜索 | 97 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 464 次阅读, 23801 次搜索 | 97 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Apple:
The Fibonacci sequence is the integer sequence defined by the recurrence relation: F(n) = F(n-1) + F(n-2), where F(0) = 0 and F(1) = 1. In other words, the nth Fibonacci number is the sum of the prior two Fibonacci numbers. Below are the first few values of the sequence:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144...
Given a number n, print the n-th Fibonacci Number.
Examples:
Input: n = 3
Output: 2
Input: n = 7
Output: 13
Here's a starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 464 次阅读, 23801 次搜索 | 97 个单词 The Fibonacci sequence is the integer sequence defined by the recurrence relation: F(n) = F(n-1) + F(n-2), where F(0) = 0 and F(1) = 1. In other words, the nth Fibonacci number is the sum of the prior two Fibonacci numbers. Below are the first few values of the sequence:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144...
Given a number n, print the n-th Fibonacci Number.
Examples:
Input: n = 3
Output: 2
Input: n = 7
Output: 13
Here's a starting point:
class Solution():
def fibonacci(self, n):
# fill this in.
n = 9
print(Solution().fibonacci(n))
# 34
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- Algorithm Interview: Convert Roman Numerals to Decimal
- Daily Interview Problem: Min Range Needed to Sort
- Daily Interview Problem: Sort Colors
- Algorithm Interview: Maximum Path Sum in Binary Tree
- Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
- Daily Interview Problem: Queue Using Two Stacks
- Longest Substring Without Repeating Characters
- Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
- Most Frequent Subtree Sum
- A trick for getting good at coding interviews FASTER
©2006~2024 牛排过熟 - 0.00896 秒 - 2246.846 KB/s - 166 在线
内存: 494.44 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
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。