Files
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.chinese.md
Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220)
* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions
2020-03-03 18:49:47 +05:30

56 lines
1.3 KiB
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f3bd1000cf542c50fed0
challengeType: 5
title: 'Problem 81: Path sum: two ways'
videoUrl: ''
localeTitle: 问题81路径总和两种方式
---
## Description
<section id="description">在下面的5乘5矩阵中从左上角到右下角的最小路径总和仅向右和向下移动以粗体红色表示等于2427。 <p> $$ \ begin {pmatrix} \ color {red} {131}67323410318 \ \ color {red} {201}\ color {red} {96}\ color {red} {342} 965150 \ 630803\ color {red} {746}\ color {red} {422}111 \ 537699497\ color {red} {121}956 \ 805732 524\ color {red} {37}\ color {red} {331} \ end {pmatrix} $$ </p><p>在matrix.txt中找到最小路径总和右键单击并“保存链接/目标为...”一个包含80 x 80矩阵的31K文本文件从左上角到右下角仅向右移动下。 </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler81()</code>应该返回427337。
testString: assert.strictEqual(euler81(), 427337);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler81() {
// Good luck!
return true;
}
euler81();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>