56 lines
1.5 KiB
Markdown
56 lines
1.5 KiB
Markdown
---
|
||
id: 5900f3be1000cf542c50fed1
|
||
challengeType: 5
|
||
title: 'Problem 82: Path sum: three ways'
|
||
videoUrl: ''
|
||
localeTitle: 问题82:路径总和:三种方式
|
||
---
|
||
|
||
## Description
|
||
<section id="description">注意:这个问题是问题81的一个更具挑战性的版本。在下面的5乘5矩阵中的最小路径总和,从左列中的任何单元格开始并在右列中的任何单元格中完成,并且仅向上,向下移动,右边用红色和粗体表示;总和等于994。 <p> $$ \ begin {pmatrix} 131&673&\ color {red} {234}&\ color {red} {103}&\ color {red} {18} \ \ color {red} {201}&\ color {红色} {96}&\ color {red} {342}&965&150 \ 630&803&746&422&111 \ 537&699&497&121&956 \ 805&732&524&37&331 \ end {pmatrix} $$ </p><p>在matrix.txt(右键单击和“Save Link / Target As ...”)中查找最小路径总和,这是一个包含80 x 80矩阵的31K文本文件,从左列到右列。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler82()</code>应返回260324。
|
||
testString: 'assert.strictEqual(euler82(), 260324, "<code>euler82()</code> should return 260324.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler82() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler82();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|