Leetcode - 53. Maximum Subarray

Leetcode - 53. Maximum Subarray

• Given an integer array nums, find the subarray with the largest sum, and return its sum.

Solution

func maxSubArray(nums []int) int {
    sumTotal := -10000
    nextPossibleSum := 0

    for i:=0; i<len(nums); i++{
        nextPossibleSum = nextPossibleSum+nums[i]
        if nextPossibleSum>sumTotal{
            sumTotal = nextPossibleSum
        }
        if nextPossibleSum<0{
            nextPossibleSum = 0
        }
    }
    return sumTotal
}