1.5 KiB
1.5 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f3be1000cf542c50fed1 | 5 | Problem 82: Path sum: three ways | 问题82:路径总和:三种方式 |
Description
$$ \ 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} $$
在matrix.txt(右键单击和“Save Link / Target As ...”)中查找最小路径总和,这是一个包含80 x 80矩阵的31K文本文件,从左列到右列。
Instructions
Tests
tests:
- text: <code>euler82()</code>应返回260324。
testString: 'assert.strictEqual(euler82(), 260324, "<code>euler82()</code> should return 260324.");'
Challenge Seed
function euler82() {
// Good luck!
return true;
}
euler82();
Solution
// solution required