Oliver Eyton-Williams ee1e8abd87
feat(curriculum): restore seed + solution to Chinese (#40683)
* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
2021-01-12 19:31:00 -07:00

1.9 KiB
Raw Blame History

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
afcc8d540bea9ea2669306b6 重复输出字符串 5 16041 repeat-a-string-repeat-a-string

--description--

num times第二个参数重复给定的字符串str (第一个参数)。如果num不是正数,则返回空字符串。如果卡住,请记得使用Read-Search-Ask 。编写自己的代码。

将一个给定的字符串 str(第一个参数)重复输出 num(第二个参数)次。如果 num 不是正数,返回空字符串。在这个挑战中,请不要使用 JavaScript 内置的 .repeat() 方法。

--hints--

repeatStringNumTimes("*", 3) 应返回 "***"

assert(repeatStringNumTimes('*', 3) === '***');

repeatStringNumTimes("abc", 3) 应返回 "abcabcabc"

assert(repeatStringNumTimes('abc', 3) === 'abcabcabc');

repeatStringNumTimes("abc", 4) 应返回 "abcabcabcabc"

assert(repeatStringNumTimes('abc', 4) === 'abcabcabcabc');

repeatStringNumTimes("abc", 1) 应返回 "abc"

assert(repeatStringNumTimes('abc', 1) === 'abc');

repeatStringNumTimes("*", 8) 应返回 "********"

assert(repeatStringNumTimes('*', 8) === '********');

repeatStringNumTimes("abc", -2) 应返回 ""

assert(repeatStringNumTimes('abc', -2) === '');

不应使用内置的 repeat() 方法。

assert(!/\.repeat/g.test(code));

repeatStringNumTimes("abc", 0) 应返回 ""

assert(repeatStringNumTimes('abc', 0) === '');

--seed--

--seed-contents--

function repeatStringNumTimes(str, num) {
  return str;
}

repeatStringNumTimes("abc", 3);

--solutions--

function repeatStringNumTimes(str, num) {
  if (num < 1) return '';
  return num === 1 ? str : str + repeatStringNumTimes(str, num-1);
}

repeatStringNumTimes("abc", 3);