Saved from https://leetcode-cn.com/problems/maximum-subarray/submissions/
func maxSubArray(nums []int) int { s, max := 0, -int(^uint(0)>>1) for _, a := range nums { if s <= 0 { s = 0 } s += a if s > max { max = s } } return max }