freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.chinese.md

id	challengeType	title	videoUrl	localeTitle
5900f4021000cf542c50ff13	5	Problem 149: Searching for a maximum-sum subsequence		问题149：搜索最大和子序列

Description

undefined

Instructions

Tests

tests:
  - text: <code>euler149()</code>应该返回52852124。
    testString: 'assert.strictEqual(euler149(), 52852124, "<code>euler149()</code> should return 52852124.");'

Challenge Seed

function euler149() {
  // Good luck!
  return true;
}

euler149();

Solution

// solution required