coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-19 03:56:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
leetcode-cn/problem (English)/连续数列(English) [contiguous-sequence-lcci].html
View File

@@ -1,13 +1,13 @@
<p>You are given an array of integers (both positive and negative). Find the contiguous sequence with the largest sum. Return the sum.</p>
<p><strong>Example: </strong></p>
<pre>
<strong>Input: </strong> [-2,1,-3,4,-1,2,1,-5,4]
<strong>Output: </strong> 6
<strong>Explanation: </strong> [4,-1,2,1] has the largest sum 6.
</pre>
<p><strong>Follow Up: </strong></p>
<p>If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.</p>
<p>You are given an array of integers (both positive and negative). Find the contiguous sequence with the largest sum. Return the sum.</p>
<p><strong>Example: </strong></p>
<pre>
<strong>Input: </strong> [-2,1,-3,4,-1,2,1,-5,4]
<strong>Output: </strong> 6