Get the nth Fibonacci number in O(n) time and O(1) space complexity.

Get the nth Fibonacci number in O(n) time and O(1) space complexity.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, wipro, company-specific

目标公司: Wipro

参考答案摘要

//Javascript function fib(n){ let [x, y] = [0, 1] while (n > 0){ [x, y] = [y, x + y] n -= 1 } return x } This solution has a linear time complexity of O(n) and a constant space complexity of O(1). The...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。