refactor 1186

fishercoder1534 · fishercoder1534 · commit 730869dcca2f · 2020-08-12T11:57:09.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1186.java b/src/main/java/com/fishercoder/solutions/_1186.java
@@ -1,32 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 1186. 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 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 <= 10^5
- * -10^4 <= arr[i] <= 10^4
- * */
 public class _1186 {
     public static class Solution1 {
         public int maximumSum(int[] arr) {
