{ "data": { "question": { "questionId": "2775", "questionFrontendId": "2648", "categoryTitle": "JavaScript", "boundTopicId": 2238333, "title": "Generate Fibonacci Sequence", "titleSlug": "generate-fibonacci-sequence", "content": "

Write a generator function that returns a generator object which yields the fibonacci sequence.

\n\n

The fibonacci sequence is defined by the relation Xn = Xn-1 + Xn-2.

\n\n

The first few numbers of the series are 0, 1, 1, 2, 3, 5, 8, 13.

\n\n

 

\n

Example 1:

\n\n
\nInput: callCount = 5\nOutput: [0,1,1,2,3]\nExplanation:\nconst gen = fibGenerator();\ngen.next().value; // 0\ngen.next().value; // 1\ngen.next().value; // 1\ngen.next().value; // 2\ngen.next().value; // 3\n
\n\n

Example 2:

\n\n
\nInput: callCount = 0\nOutput: []\nExplanation: gen.next() is never called so nothing is outputted\n
\n\n

 

\n

Constraints:

\n\n\n", "translatedTitle": "生成斐波那契数列", "translatedContent": "

请你编写一个生成器函数，并返回一个可以生成 斐波那契数列 的生成器对象。

\n\n

斐波那契数列 的递推公式为 Xn = Xn-1 + Xn-2 。

\n\n

这个数列的前几个数字是 0, 1, 1, 2, 3, 5, 8, 13 。

\n\n

 

\n\n

示例 1：

\n\n
\n输入：callCount = 5\n输出：[0,1,1,2,3]\n解释：\nconst gen = fibGenerator();\ngen.next().value; // 0\ngen.next().value; // 1\ngen.next().value; // 1\ngen.next().value; // 2\ngen.next().value; // 3\n
\n\n

示例 2：

\n\n
\n输入：callCount = 0\n输出：[]\n解释：gen.next() 永远不会被调用，所以什么也不会输出\n
\n\n

 

\n\n

提示：

\n\n\n", "isPaidOnly": false, "difficulty": "Easy", "likes": 9, "dislikes": 0, "isLiked": null, "similarQuestions": "[{\"title\": \"Nested Array Generator\", \"titleSlug\": \"nested-array-generator\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u5d4c\\u5957\\u6570\\u7ec4\\u751f\\u6210\\u5668\", \"isPaidOnly\": false}, {\"title\": \"Design Cancellable Function\", \"titleSlug\": \"design-cancellable-function\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u8bbe\\u8ba1\\u53ef\\u53d6\\u6d88\\u51fd\\u6570\", \"isPaidOnly\": false}]", "contributors": [], "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python3\": true, \"python\": true, \"javascript\": false, \"typescript\": false, \"csharp\": false, \"c\": false, \"golang\": false, \"kotlin\": false, \"swift\": false, \"rust\": false, \"ruby\": false, \"php\": false, \"dart\": false, \"scala\": false, \"elixir\": false, \"erlang\": false, \"racket\": false, \"cangjie\": false, \"bash\": false, \"html\": false, \"pythonml\": false, \"react\": false, \"vanillajs\": false, \"mysql\": false, \"mssql\": false, \"postgresql\": false, \"oraclesql\": false, \"pythondata\": false}", "topicTags": [], "companyTagStats": null, "codeSnippets": [ { "lang": "JavaScript", "langSlug": "javascript", "code": "/**\n * @return {Generator}\n */\nvar fibGenerator = function*() {\n \n};\n\n/**\n * const gen = fibGenerator();\n * gen.next().value; // 0\n * gen.next().value; // 1\n */", "__typename": "CodeSnippetNode" }, { "lang": "TypeScript", "langSlug": "typescript", "code": "function* fibGenerator(): Generator {\n \n};\n\n/**\n * const gen = fibGenerator();\n * gen.next().value; // 0\n * gen.next().value; // 1\n */", "__typename": "CodeSnippetNode" } ], "stats": "{\"totalAccepted\": \"6.8K\", \"totalSubmission\": \"8.4K\", \"totalAcceptedRaw\": 6817, \"totalSubmissionRaw\": 8416, \"acRate\": \"81.0%\"}", "hints": [ "Javascript has the concept of generators. They are critical to this problem.", "First yield 0 and 1.", "Create an infinite \"while(true)\" loop.", "In that loop, continuously yield the next value which is the sum of the previous two." ], "solution": null, "status": null, "sampleTestCase": "5", "metaData": "{\n \"name\": \"fibGenerator\",\n \"params\": [\n {\n \"name\": \"callCount\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n },\n \"languages\": [\n \"typescript\",\n \"javascript\"\n ],\n \"manual\": true\n}", "judgerAvailable": true, "judgeType": "large", "mysqlSchemas": [], "enableRunCode": true, "envInfo": "{\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 22.14.0<\\/code><\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js <\\/a>\\u5e93\\u6240\\u63d0\\u4f9b\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u3002<\\/p>\"],\"typescript\":[\"TypeScript\",\"

TypeScript 5.7.3<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2024<\\/p>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js <\\/a>\\u5e93\\u6240\\u63d0\\u4f9b\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u3002<\\/p>\"]}", "book": null, "isSubscribed": false, "isDailyQuestion": false, "dailyRecordStatus": null, "editorType": "CKEDITOR", "ugcQuestionId": null, "style": "LEETCODE", "exampleTestcases": "5\n0", "__typename": "QuestionNode" } } }