LeetCode——最长子序列和

找出给定数组中最长子序列的和

func Max(x, y int)int{
	if x<y{
		return x
	}
	return y
}
func MaxSubSum(arr []int, n int) int {
	res := make([]int, n) // 这里可以不用数组
	res[0] = arr[0]
	maxs := arr[0]
	for i := 1; i < n; i++ {
		res[i] = Max(res[i-1]+arr[i], arr[i])
		maxs = Max(maxs, res[i])
	}
	return maxs
}