56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
|
---
|
|||
|
|
id: 5900f3b01000cf542c50fec2
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 67: Maximum path sum II'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题67：最大路径总和II
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">从下面三角形的顶部开始并移动到下面一行的相邻数字，从上到下的最大总数为23. 37 4 2 4 6 8 5 9 3即3 + 7 + 4 + 9 = 23 。在triangle.txt（右键单击和'Save Link / Target As ...'）中找到从上到下的最大总数，这是一个包含一百行三角形的15K文本文件。注意：这是问题18的一个更难的版本。不可能尝试每条路线来解决这个问题，因为共有299个！如果你每秒可以检查一万亿（1012）条路线，则需要花费超过二百亿年才能检查它们。有一种有效的算法可以解决它。 ; O） </section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler67()</code>应该返回7273。
|
|||
|
|
testString: 'assert.strictEqual(euler67(), 7273, "<code>euler67()</code> should return 7273.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler67() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler67();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|