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>
This commit is contained in:
committed by
GitHub
parent
0095583028
commit
ee1e8abd87
@ -3,6 +3,7 @@ id: 594810f028c0303b75339ad4
|
||||
title: 自动换行
|
||||
challengeType: 5
|
||||
videoUrl: ''
|
||||
dashedName: word-wrap
|
||||
---
|
||||
|
||||
# --description--
|
||||
@ -55,5 +56,48 @@ assert(wrapped42.split('\n').length === 7);
|
||||
assert.equal(wrapped42.split('\n')[0], firstRow42);
|
||||
```
|
||||
|
||||
# --seed--
|
||||
|
||||
## --after-user-code--
|
||||
|
||||
```js
|
||||
const text =
|
||||
`Wrap text using a more sophisticated algorithm such as the Knuth and Plass TeX algorithm.
|
||||
If your language provides this, you get easy extra credit,
|
||||
but you ''must reference documentation'' indicating that the algorithm
|
||||
is something better than a simple minimum length algorithm.`;
|
||||
|
||||
const wrapped80 = wrap(text, 80);
|
||||
const wrapped42 = wrap(text, 42);
|
||||
|
||||
const firstRow80 =
|
||||
'Wrap text using a more sophisticated algorithm such as the Knuth and Plass TeX';
|
||||
|
||||
const firstRow42 = 'Wrap text using a more sophisticated';
|
||||
```
|
||||
|
||||
## --seed-contents--
|
||||
|
||||
```js
|
||||
function wrap(text, limit) {
|
||||
return text;
|
||||
}
|
||||
```
|
||||
|
||||
# --solutions--
|
||||
|
||||
```js
|
||||
function wrap(text, limit) {
|
||||
const noNewlines = text.replace('\n', '');
|
||||
if (noNewlines.length > limit) {
|
||||
// find the last space within limit
|
||||
const edge = noNewlines.slice(0, limit).lastIndexOf(' ');
|
||||
if (edge > 0) {
|
||||
const line = noNewlines.slice(0, edge);
|
||||
const remainder = noNewlines.slice(edge + 1);
|
||||
return line + '\n' + wrap(remainder, limit);
|
||||
}
|
||||
}
|
||||
return text;
|
||||
}
|
||||
```
|
||||
|
Reference in New Issue
Block a user