56 lines
742 B
Markdown
56 lines
742 B
Markdown
---
|
||
id: 5900f4021000cf542c50ff13
|
||
challengeType: 5
|
||
title: 'Problem 149: Searching for a maximum-sum subsequence'
|
||
videoUrl: ''
|
||
localeTitle: 问题149：搜索最大和子序列
|
||
---
|
||
|
||
## Description
|
||
undefined
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler149()</code>应该返回52852124。
|
||
testString: 'assert.strictEqual(euler149(), 52852124, "<code>euler149()</code> should return 52852124.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler149() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler149();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|