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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -0,0 +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>