61460c8601
search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
73 lines
3.0 KiB
Markdown
73 lines
3.0 KiB
Markdown
---
|
||
id: 5900f37e1000cf542c50fe91
|
||
challengeType: 5
|
||
title: 'Problem 18: Maximum path sum I'
|
||
videoUrl: ''
|
||
localeTitle: 问题18：最大路径总和I.
|
||
---
|
||
|
||
## Description
|
||
<section id="description">通过启动在低于该三角形的顶部和移动到相邻的数字下面的行中，最大总从上到下为23 <span style="display: block; text-align: center;"><b style="color: red;">3</b> <br> <b style="color: red;">7</b> 4 <br> 2 <b style="color: red;">4</b> 6 <br> 8 5 <b style="color: red;">9</b> 3</span>也就是说，3 + 7 + 4 + 9 = 23.找到下面三角形从上到下的最大总数： <span style="display: block; text-align: center;">75 <br> 95 64 <br> 17 47 82 <br> 18 35 87 10 <br> 20 04 82 47 65 <br> 19 01 23 75 03 34 <br> 88 02 77 73 07 63 67 <br> 99 65 04 28 06 16 70 92 <br> 41 41 26 56 83 40 80 70 33 <br> 41 48 72 33 47 32 37 16 94 29 <br> 53 71 44 65 25 43 91 52 97 51 14 <br> 70 11 33 28 77 73 17 78 39 68 17 57 <br> 91 71 52 38 17 14 91 43 58 50 27 29 48 <br> 63 66 04 68 89 53 67 30 73 16 69 87 40 31 <br> 04 62 98 27 23 09 70 98 73 93 38 53 60 04 23</span> <b>注意：</b>由于只有16384条路线，因此可以通过尝试每条路线来解决此问题。然而，问题67，与包含一百行的三角形是同样的挑战;它无法通过蛮力解决，需要一种聪明的方法！ ; O） </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>maximumPathSumI(testTriangle)</code>应该返回23。
|
||
testString: assert.strictEqual(maximumPathSumI(testTriangle), 23);
|
||
- text: <code>maximumPathSumI(numTriangle)</code>应该返回1074。
|
||
testString: assert.strictEqual(maximumPathSumI(numTriangle), 1074);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function maximumPathSumI(triangle) {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
const testTriangle = [[3, 0, 0, 0],
|
||
[7, 4, 0, 0],
|
||
[2, 4, 6, 0],
|
||
[8, 5, 9, 3]];
|
||
|
||
maximumPathSumI(testTriangle);
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
### Before Test
|
||
<div id='js-setup'>
|
||
|
||
```js
|
||
const numTriangle = [[75, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [95, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [17, 47, 82, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [18, 35, 87, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [20, 4, 82, 47, 65, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [19, 1, 23, 75, 3, 34, 0, 0, 0, 0, 0, 0, 0, 0, 0], [88, 2, 77, 73, 7, 63, 67, 0, 0, 0, 0, 0, 0, 0, 0], [99, 65, 4, 28, 6, 16, 70, 92, 0, 0, 0, 0, 0, 0, 0], [41, 41, 26, 56, 83, 40, 80, 70, 33, 0, 0, 0, 0, 0, 0], [41, 48, 72, 33, 47, 32, 37, 16, 94, 29, 0, 0, 0, 0, 0], [53, 71, 44, 65, 25, 43, 91, 52, 97, 51, 14, 0, 0, 0, 0], [70, 11, 33, 28, 77, 73, 17, 78, 39, 68, 17, 57, 0, 0, 0], [91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29, 48, 0, 0], [63, 66, 4, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31, 0], [4, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 4, 23]];
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|