56 lines
1.4 KiB
Markdown
56 lines
1.4 KiB
Markdown
|
---
|
|||
|
|
id: 5900f3bd1000cf542c50fed0
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 81: Path sum: two ways'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题81：路径总和：两种方式
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">在下面的5乘5矩阵中，从左上角到右下角的最小路径总和，仅向右和向下移动，以粗体红色表示，等于2427。 <p> $$ \ begin {pmatrix} \ color {red} {131}＆673＆234＆103＆18 \ \ color {red} {201}＆\ color {red} {96}＆\ color {red} {342} ＆965＆150 \ 630＆803＆\ color {red} {746}＆\ color {red} {422}＆111 \ 537＆699＆497＆\ color {red} {121}＆956 \ 805＆732＆ 524＆\ color {red} {37}＆\ color {red} {331} \ end {pmatrix} $$ </p><p>在matrix.txt中找到最小路径总和（右键单击并“保存链接/目标为...”），一个包含80 x 80矩阵的31K文本文件，从左上角到右下角仅向右移动下。 </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler81()</code>应该返回427337。
|
|||
|
|
testString: 'assert.strictEqual(euler81(), 427337, "<code>euler81()</code> should return 427337.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler81() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler81();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|