牛客题霸 NC19 子数组的最大累加和问题

Posted 2021-09-07 Starzkg

https://www.nowcoder.com/practice/554aa508dd5d4fefbf0f86e5fe953abd

解决方案

Go

func maxsumofSubarray(arr []int) int {
	// write code here
	cur, Max := 0, 0
	for _, a := range arr {
		cur = max(cur+a, a)
		Max = max(cur, Max)
	}
	return Max
}

func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func main() {
	maxsumofSubarray([]int{1, -2, 3, 5, -2, 6, -1})
}

参考文章