[LeetCode] 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, y