2019-11-02 12:07:41 +08:00
|
|
|
|
# 42. 连续子数组的最大和
|
|
|
|
|
|
|
|
|
|
|
|
[NowCoder](https://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484?tpId=13&tqId=11183&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
|
|
|
|
|
|
|
|
|
|
|
|
## 题目描述
|
|
|
|
|
|
|
|
|
|
|
|
{6, -3, -2, 7, -15, 1, 2, 2}，连续子数组的最大和为 8（从第 0 个开始，到第 3 个为止）。
|
|
|
|
|
|
|
|
|
|
|
|
## 解题思路
|
|
|
|
|
|
|
|
|
|
|
|
```java
|
|
|
|
|
|
public int FindGreatestSumOfSubArray(int[] nums) {
|
|
|
|
|
|
if (nums == null || nums.length == 0)
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
int greatestSum = Integer.MIN_VALUE;
|
|
|
|
|
|
int sum = 0;
|
|
|
|
|
|
for (int val : nums) {
|
|
|
|
|
|
sum = sum <= 0 ? val : sum + val;
|
|
|
|
|
|
greatestSum = Math.max(greatestSum, sum);
|
|
|
|
|
|
}
|
|
|
|
|
|
return greatestSum;
|
|
|
|
|
|
}
|
|
|
|
|
|
```
|
|
|
|
|
|
|
2019-11-02 14:39:13 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
<div align="center"><img width="320px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/githubio/公众号二维码-1.png"></img></div>
|
