L53-Maximum-Subarray

func (a int, b int)int  {
	if a>b {
		return a
	}else{
		return b
	}
}
func maxSubArray(nums []int) int {
	n := len(nums)

	if n == 0 {
		return 0
	}

	if n == 1 {
		return nums[0]
大专栏  L53-Maximum-Subarrays="line">	}

	sums := make([]int, n)
	maxSum := nums[0]
	sums[0] = nums[0]

	for i:=1;i<n ; i++ {
		sums[i] = max(sums[i-1]+nums[i], nums[i])
		maxSum = max(sums[i], maxSum)
	}
	return maxSum
}

func maxSubArray(nums []int) int {
	n := len(nums)

	if n == 0 {
		return 0
	}
	
	maxSum := nums[0]
	curSum := nums[0]

	for i:=1;i<n ; i++ {
		if curSum<0 {
			curSum = nums[i]
		}else{
			curSum += nums[i]
		}

		if curSum>maxSum {
			maxSum = curSum
		}
	}
	return maxSum
}