mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
44 lines
2.0 KiB
HTML
44 lines
2.0 KiB
HTML
<p>You are given a <strong>0-indexed</strong> array <code>nums</code> consisting of positive integers.</p>
|
|
|
|
<p>There are two types of operations that you can apply on the array <strong>any</strong> number of times:</p>
|
|
|
|
<ul>
|
|
<li>Choose <strong>two</strong> elements with <strong>equal</strong> values and <strong>delete</strong> them from the array.</li>
|
|
<li>Choose <strong>three</strong> elements with <strong>equal</strong> values and <strong>delete</strong> them from the array.</li>
|
|
</ul>
|
|
|
|
<p>Return <em>the <strong>minimum</strong> number of operations required to make the array empty, or </em><code>-1</code><em> if it is not possible</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [2,3,3,2,2,4,2,3,4]
|
|
<strong>Output:</strong> 4
|
|
<strong>Explanation:</strong> We can apply the following operations to make the array empty:
|
|
- Apply the first operation on the elements at indices 0 and 3. The resulting array is nums = [3,3,2,4,2,3,4].
|
|
- Apply the first operation on the elements at indices 2 and 4. The resulting array is nums = [3,3,4,3,4].
|
|
- Apply the second operation on the elements at indices 0, 1, and 3. The resulting array is nums = [4,4].
|
|
- Apply the first operation on the elements at indices 0 and 1. The resulting array is nums = [].
|
|
It can be shown that we cannot make the array empty in less than 4 operations.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [2,1,2,2,3,3]
|
|
<strong>Output:</strong> -1
|
|
<strong>Explanation:</strong> It is impossible to empty the array.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>2 <= nums.length <= 10<sup>5</sup></code></li>
|
|
<li><code>1 <= nums[i] <= 10<sup>6</sup></code></li>
|
|
</ul>
|
|
|
|
<p> </p>
|
|
<p><strong>Note:</strong> This question is the same as <a href="https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/description/" target="_blank">2244: Minimum Rounds to Complete All Tasks.</a></p>
|