* 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>
61 lines
1.0 KiB
Markdown
61 lines
1.0 KiB
Markdown
---
|
||
id: 5900f37b1000cf542c50fe8e
|
||
title: 问题15:格子路径
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-15-lattice-paths
|
||
---
|
||
|
||
# --description--
|
||
|
||
从2×2网格的左上角开始,只能向右和向下移动,右下角有6条路线。 
|
||
|
||
通过给定的`gridSize`有多少这样的路由?
|
||
|
||
# --hints--
|
||
|
||
`latticePaths(4)`应该返回70。
|
||
|
||
```js
|
||
assert.strictEqual(latticePaths(4), 70);
|
||
```
|
||
|
||
`latticePaths(9)`应该返回48620。
|
||
|
||
```js
|
||
assert.strictEqual(latticePaths(9), 48620);
|
||
```
|
||
|
||
`latticePaths(20)`应该返回137846528820。
|
||
|
||
```js
|
||
assert.strictEqual(latticePaths(20), 137846528820);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function latticePaths(gridSize) {
|
||
|
||
return true;
|
||
}
|
||
|
||
latticePaths(4);
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
function latticePaths(gridSize) {
|
||
let paths = 1;
|
||
|
||
for (let i = 0; i < gridSize; i++) {
|
||
paths *= (2 * gridSize) - i;
|
||
paths /= i + 1;
|
||
}
|
||
return paths;
|
||
}
|
||
```
|