gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(i8n,learn): processed translations

Browse Source
This commit is contained in:
Crowdin Bot
2021-02-06 04:42:36 +00:00
committed by Mrugesh Mohapatra
parent 15047f2d90
commit e5c44a3ae5
3274 changed files with 172122 additions and 14164 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
View File

@ -1,48 +1,56 @@
---
id: 59637c4d89f6786115efd814
title: Hofstadter Q序列
title: Hofstadter Q sequence
challengeType: 5
videoUrl: ''
forumTopicId: 302287
dashedName: hofstadter-q-sequence
---
# --description--
<p> <a href='https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Q_sequence' title='wp：Hofstadter_sequence＃Hofstadter_Q_sequence'>Hofstadter Q序列</a>定义为： </p><p> $ Q（1）= Q（2）= 1，\\ Q（n）= Q \ big（nQ（n-1）\ big）+ Q \ big（nQ（n-2）），\ quad n> 2. $ </p><p>它定义为<a href='http://rosettacode.org/wiki/Fibonacci sequence' title='斐波那契序列'>Fibonacci序列</a> ，但<a href='http://rosettacode.org/wiki/Fibonacci sequence' title='斐波那契序列'>Fibonacci序列中</a>的下一个术语是前两个术语的总和，在Q序列中，前两个术语告诉您在Q序列中返回多远以找到两个数字总结以制作序列的下一个术语。 </p>任务：将Hofstadter Q Sequence方程实现为JavaScript
The [Hofstadter Q sequence](https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Q_sequence "wp: Hofstadter_sequence#Hofstadter_Q_sequence") is defined as:
$Q(1)=Q(2)=1, \\\\ Q(n)=Q\\big(n-Q(n-1)\\big)+Q\\big(n-Q(n-2)), \\quad n>2.$
It is defined like the [Fibonacci sequence](https://rosettacode.org/wiki/Fibonacci sequence "Fibonacci sequence"), but whereas the next term in the Fibonacci sequence is the sum of the previous two terms, in the Q sequence the previous two terms tell you how far to go back in the Q sequence to find the two numbers to sum to make the next term of the sequence.
# --instructions--
Implement the Hofstadter Q Sequence equation as a function. The function should accept number, `n`, and return an integer.
# --hints--
`hofstadterQ`是一个函数。
`hofstadterQ` should be a function.
```js
assert(typeof hofstadterQ === 'function');
```
`hofstadterQ()`应该返回`integer`
`hofstadterQ()` should return `integer`
```js
assert(Number.isInteger(hofstadterQ(1000)));
```
`hofstadterQ(1000)`应该返回`502`
`hofstadterQ(1000)` should return `502`
```js
assert.equal(hofstadterQ(testCase[0]), res[0]);
```
`hofstadterQ(1500)`应该返回`755`
`hofstadterQ(1500)` should return `755`
```js
assert.equal(hofstadterQ(testCase[1]), res[1]);
```
`hofstadterQ(2000)`应该返回`1005`
`hofstadterQ(2000)` should return `1005`
```js
assert.equal(hofstadterQ(testCase[2]), res[2]);
```
`hofstadterQ(2500)`应该返回`1261`
`hofstadterQ(2500)` should return `1261`
```js
assert.equal(hofstadterQ(testCase[3]), res[3]);