9 lines
502 B
Markdown
9 lines
502 B
Markdown
|
---
|
|||
|
|
title: Searching for a maximum-sum subsequence
|
|||
|
|
localeTitle: 搜索最大和子序列
|
|||
|
|
---
|
|||
|
|
## 问题149：搜索最大和子序列
|
|||
|
|
|
|||
|
|
这是一个存根。 [帮助我们的社区扩展它](https://github.com/freecodecamp/guides/tree/master/src/pages/certifications/coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence/index.md) 。
|
|||
|
|
|
|||
|
|
[这种快速风格指南有助于确保您的拉取请求被接受](https://github.com/freecodecamp/guides/blob/master/README.md) 。
|