package leetcode;

public class Problem1186 {
}

@@ -16,33 +16,518 @@
 e;%0A%0A
-public class Problem1186 %7B
+/**%0A * https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion/%0A */%0Apublic class Problem1186 %7B%0A    public int maximumSum(int%5B%5D arr) %7B%0A        // TODO%0A        return 0;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        Problem1186 prob = new Problem1186();%0A        System.out.println(prob.maximumSum(new int%5B%5D%7B1, -2, 0, 3%7D)); // 4%0A        System.out.println(prob.maximumSum(new int%5B%5D%7B1, -2, -2, 3%7D)); // 3%0A        System.out.println(prob.maximumSum(new int%5B%5D%7B-1, -1, -1, -1%7D)); // -1%0A    %7D
 %0A%7D%0A

Update problem 1186