1.5 KiB
1.5 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f3bf1000cf542c50fed2 | 5 | Problem 83: Path sum: four ways | 问题83:路径总和:四种方式 |
Description
$$ \ begin {pmatrix} \ color {red} {131}&673&\ color {red} {234}&\ color {red} {103}&\ color {red} {18} \ \ color {red} {201}&\ color {red} {96}&\ color {red} {342}&965&\ color {red} {150} \ 630&803&746&\ color {red} {422}&\ color {red} {111} \ 537&699&497&\ color {red} {121}&956 \ 805&732&524&\ color {red} {37}&\ color {red} {331} \ end { pmatrix} $$
在matrix.txt中找到最小路径总和(右键单击并“保存链接/目标为...”),一个包含80 x 80矩阵的31K文本文件,通过向左,向右移动从左上角到右下角, 上和下。
Instructions
Tests
tests:
- text: <code>euler83()</code>应返回425185。
testString: 'assert.strictEqual(euler83(), 425185, "<code>euler83()</code> should return 425185.");'
Challenge Seed
function euler83() {
// Good luck!
return true;
}
euler83();
Solution
// solution required