斐波那契序列 中等

by windliang @wind-liang

接受挑战    English

Implement a generic Fibonacci\ takes an number T and returns it's corresponding [Fibonacci number](https://en.wikipedia.org/wiki/Fibonacci_number). The sequence starts: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ... For example ```js type Result1 = Fibonacci<3> // 2 type Result2 = Fibonacci<8> // 21 ```
返回首页 分享你的解答 查看解答