不求前途凶吉，但求落幕无悔！

https://leetcode-cn.com/problems/maximum-subarray/ 贪心算法 package main import "fmt" func main() { res := maxSubArray([]int{-3, -1, -5}) fmt.Println(res) } func maxSubArray(nums []int) int { if len(nums) == 0 { return 0 } var max