Title: 斐波那契数列 | 凡是过往、皆为序章
Open Graph Title: 斐波那契数列
Description: 斐波那契数列 题目链接 牛客网 题目描述 大家都知道斐波那契数列,现在要求输入一个正整数 n ,请你输出斐波那契数列的第 n 项。 斐波那契数列是一个满足: x = 1,2时 fib(x) = 1 x > 2 时 fib(x) = fib(x−1) + fib(x−2) 的数列 数据范围: 1≤n≤40 要求:空间复杂度O(1),时间复杂度O(n) ,...
Open Graph Description: 斐波那契数列 题目链接 牛客网 题目描述 大家都知道斐波那契数列,现在要求输入一个正整数 n ,请你输出斐波那契数列的第 n 项。 斐波那契数列是一个满足: x = 1,2时 fib(x) = 1 x > 2 时 fib(x) = fib(x−1) + fib(x−2) 的数列 数据范围: 1≤n≤40 要求:空间复杂度O(1),时间复杂度O(n) ,...
Opengraph URL: https://142vip.cn/JavaScriptCollection/solo-algorithm/interview-101/fibonacci.html
Generator: VuePress 2.0.0-rc.22
Domain: 142vip.github.io
{"@context":"https://schema.org","@type":"Article","headline":"斐波那契数列","image":[""],"dateModified":"2024-07-29T15:43:01.000Z","author":[{"@type":"Person","name":"微信公众号:储凡","email":"fairy_vip@2925.com","url":"https://github.com/142vip","homePage":"https://142vip.cn","github":"https://gitee.com/mmdapl","githubVip":"https://gitee.com/chufan443","gitee":"https://gitee.com/chufan443"}]}
| theme | VuePress Theme Hope 2.0.0-rc.87 |
| og:site_name | 凡是过往、皆为序章 |
| og:type | article |
| og:locale | zh-CN |
| og:updated_time | 2024-07-29T15:43:01.000Z |
| article:modified_time | 2024-07-29T15:43:01.000Z |
| datePublished | 2023-03-24T10:03:59.000Z |
| timeRequired | PT2M |
Links:
Viewport: width=device-width,initial-scale=1