mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
39 lines
1.5 KiB
HTML
39 lines
1.5 KiB
HTML
<p>You are given an integer array <code>nums</code>. You want to maximize the number of points you get by performing the following operation any number of times:</p>
|
|
|
|
<ul>
|
|
<li>Pick any <code>nums[i]</code> and delete it to earn <code>nums[i]</code> points. Afterwards, you must delete <b>every</b> element equal to <code>nums[i] - 1</code> and <strong>every</strong> element equal to <code>nums[i] + 1</code>.</li>
|
|
</ul>
|
|
|
|
<p>Return <em>the <strong>maximum number of points</strong> you can earn by applying the above operation some number of times</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [3,4,2]
|
|
<strong>Output:</strong> 6
|
|
<strong>Explanation:</strong> You can perform the following operations:
|
|
- Delete 4 to earn 4 points. Consequently, 3 is also deleted. nums = [2].
|
|
- Delete 2 to earn 2 points. nums = [].
|
|
You earn a total of 6 points.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [2,2,3,3,3,4]
|
|
<strong>Output:</strong> 9
|
|
<strong>Explanation:</strong> You can perform the following operations:
|
|
- Delete a 3 to earn 3 points. All 2's and 4's are also deleted. nums = [3,3].
|
|
- Delete a 3 again to earn 3 points. nums = [3].
|
|
- Delete a 3 once more to earn 3 points. nums = [].
|
|
You earn a total of 9 points.</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 2 * 10<sup>4</sup></code></li>
|
|
<li><code>1 <= nums[i] <= 10<sup>4</sup></code></li>
|
|
</ul>
|