|
| 1 | +<h2><a href="https://leetcode.com/problems/maximum-erasure-value">Maximum Erasure Value</a></h2> <img src='https://img.shields.io/badge/Difficulty-Medium-orange' alt='Difficulty: Medium' /><hr><p>You are given an array of positive integers <code>nums</code> and want to erase a subarray containing <strong>unique elements</strong>. The <strong>score</strong> you get by erasing the subarray is equal to the <strong>sum</strong> of its elements.</p> |
| 2 | + |
| 3 | +<p>Return <em>the <strong>maximum score</strong> you can get by erasing <strong>exactly one</strong> subarray.</em></p> |
| 4 | + |
| 5 | +<p>An array <code>b</code> is called to be a <span class="tex-font-style-it">subarray</span> of <code>a</code> if it forms a contiguous subsequence of <code>a</code>, that is, if it is equal to <code>a[l],a[l+1],...,a[r]</code> for some <code>(l,r)</code>.</p> |
| 6 | + |
| 7 | +<p> </p> |
| 8 | +<p><strong class="example">Example 1:</strong></p> |
| 9 | + |
| 10 | +<pre> |
| 11 | +<strong>Input:</strong> nums = [4,2,4,5,6] |
| 12 | +<strong>Output:</strong> 17 |
| 13 | +<strong>Explanation:</strong> The optimal subarray here is [2,4,5,6]. |
| 14 | +</pre> |
| 15 | + |
| 16 | +<p><strong class="example">Example 2:</strong></p> |
| 17 | + |
| 18 | +<pre> |
| 19 | +<strong>Input:</strong> nums = [5,2,1,2,5,2,1,2,5] |
| 20 | +<strong>Output:</strong> 8 |
| 21 | +<strong>Explanation:</strong> The optimal subarray here is [5,2,1] or [1,2,5]. |
| 22 | +</pre> |
| 23 | + |
| 24 | +<p> </p> |
| 25 | +<p><strong>Constraints:</strong></p> |
| 26 | + |
| 27 | +<ul> |
| 28 | + <li><code>1 <= nums.length <= 10<sup>5</sup></code></li> |
| 29 | + <li><code>1 <= nums[i] <= 10<sup>4</sup></code></li> |
| 30 | +</ul> |
0 commit comments