Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md

22 lines
694 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters
This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.
---
id: 5900f3d51000cf542c50fee6
title: 问题104Pandigital Fibonacci结束
challengeType: 5
videoUrl: ''
---
# --description--
Fibonacci序列由递归关系定义Fn = Fn-1 + Fn-2其中F1 = 1且F2 = 1.事实证明包含113位数字的F541是第一个斐波那契数字其中最后九个数字是1-9 pandigital包含所有数字1到9但不一定按顺序。 F2749包含575个数字是第一个斐波那契数字前九个数字是1-9 pandigital。鉴于Fk是第一个斐波纳契数前九个数字和后九个数字是1-9 pandigital找到k。
# --hints--
`euler104()`应返回329468。
```js
assert.strictEqual(euler104(), 329468);
```
# --solutions--