maximum-unique-subarray-sum-after-deletion

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code>.

You are allowed to delete any number of elements from <code>nums</code> without making it empty. After performing the deletions, select a subarray of <code>nums</code> such that:

<ol>
	<li>All elements in the subarray are unique.</li>
	<li>The sum of the elements in the subarray is maximized.</li>
</ol>

Return the maximum sum of such a subarray.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [1,2,3,4,5]

Output: 15

Explanation:

Select the entire array without deleting any element to obtain the maximum sum.
</div>

Example 2:

<div class="example-block">
Input: nums = [1,1,0,1,1]

Output: 1

Explanation:

Delete the element <code>nums[0] == 1</code>, <code>nums[1] == 1</code>, <code>nums[2] == 0</code>, and <code>nums[3] == 1</code>. Select the entire array <code>[1]</code> to obtain the maximum sum.
</div>

Example 3:

<div class="example-block">
Input: nums = [1,2,-1,-2,1,0,-1]

Output: 3

Explanation:

Delete the elements <code>nums[2] == -1</code> and <code>nums[3] == -2</code>, and select the subarray <code>[2, 1]</code> from <code>[1, 2, 1, 0, -1]</code> to obtain the maximum sum.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
	<li><code>-100 &lt;= nums[i] &lt;= 100</code></li>
</ul>