Package g1101_1200.s1186_maximum_subarray_sum_with_one_deletion

Class Solution

java.lang.Object

g1101_1200.s1186_maximum_subarray_sum_with_one_deletion.Solution

public class Solution
extends Object

1186 - Maximum Subarray Sum with One Deletion\. Medium 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 1:** **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. **Example 2:** **Input:** arr = [1,-2,-2,3] **Output:** 3 **Explanation:** We just choose [3] and it's the maximum sum. **Example 3:** **Input:** arr = [-1,-1,-1,-1] **Output:** -1 **Explanation:** The final subarray needs to be non-empty. You can't choose [-1] and delete -1 from it, then get an empty subarray to make the sum equals to 0. **Constraints:** * 1 <= arr.length <= 105 * -104 <= arr[i] <= 104

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	maximumSum(int[] arr)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

maximumSum

public int maximumSum(int[] arr)