19 lines
402 B
Go
19 lines
402 B
Go
// Package q53 implements a solution for https://leetcode.com/problems/maximum-subarray/
|
|
package q53
|
|
|
|
import "math"
|
|
|
|
func maxSubArray(nums []int) int {
|
|
sum := 0
|
|
minSubstract := 0
|
|
maxSubArr := math.MinInt
|
|
for i := range nums {
|
|
sum += nums[i]
|
|
nums[i] = sum
|
|
maxSubArr = max(maxSubArr, nums[i]-minSubstract)
|
|
minSubstract = min(minSubstract, nums[i])
|
|
}
|
|
return maxSubArr
|
|
}
|
|
|
|
var _ = maxSubArray
|