题解| 简单贪心 | #连续子数组的最大和#
连续子数组的最大和
https://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484
package main import "math" /** 当前sum小于0,对后续sum增大无贡献,故可赋值0舍弃,重新开始计数 */ func FindGreatestSumOfSubArray( array []int ) int { // write code here curSum := 0 res := math.MinInt16 for i := range array { curSum += array[i] res = max(res, curSum) if curSum < 0 { curSum = 0 } } return res } func max(a, b int) int {if a > b {return a}; return b}