题解 | #连续子数组的最大和#

package main

import "math"

/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 *
 * @param array int整型一维数组
 * @return int整型
 */
func FindGreatestSumOfSubArray(array []int) int {
	// write code here
	sum := 0
	maxSum := array[0]
	for i := 0; i < len(array); i++ {
		sum = int(math.Max(float64(sum+array[i]), float64(array[i])))
		maxSum = int(math.Max(float64(maxSum), float64(sum)))
	}

	return maxSum
}