[LeetCode]Maximum Subarray Sum with One Deletion@Golang

Maximum Subarray Sum with One Deletion
Given an array of integers, return the maximum sum for a non-empty subarray (contiguous elements) with at most one element deletion. In other words, you want to choose a subarray and optionally delete one element from it so that there is still at least one element left and the sum of the remaining elements is maximum possible.

Note that the subarray needs to be non-empty after deleting one element.

Example

Input: arr = [1,-2,0,3]
Output: 4
Explanation: Because we can choose [1, -2, 0, 3] and drop -2, thus the subarray [1, 0, 3] becomes the maximum value.

Solution

func maximumSum(arr []int) int {
    n := len(arr)
    maxright := make([]int,n)
    maxleft := make([]int,n)
    
    maxright[0] = arr[0]
    maxleft[n-1] = arr[n-1]
    
    ret := arr[0]
    
    for i:=1;i<n;i++{
        maxright[i] = max(arr[i], maxright[i-1]+arr[i])
        j := n-1-i
        maxleft[j] = max(arr[j], maxleft[j+1]+arr[j])
        ret = max(ret, maxright[i])
    }
    
    for i:=1;i<n-1;i++{
        ret = max(ret, maxright[i-1]+maxleft[i+1])
    }
    return ret
}
func max(a, b int)int{
    if a>b{
        return a
    }
    return b
}