1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 14:12:17 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions

View File

@@ -2,7 +2,7 @@
"data": {
"question": {
"questionId": "1355",
"questionFrontendId": "5236",
"questionFrontendId": "2216",
"categoryTitle": "Algorithms",
"boundTopicId": 1366088,
"title": "Minimum Deletions to Make Array Beautiful",
@@ -12,7 +12,7 @@
"translatedContent": "<p>给你一个下标从 <strong>0</strong> 开始的整数数组 <code>nums</code> ,如果满足下述条件,则认为数组 <code>nums</code> 是一个 <strong>美丽数组</strong> </p>\n\n<ul>\n\t<li><code>nums.length</code> 为偶数</li>\n\t<li>对所有满足 <code>i % 2 == 0</code> 的下标 <code>i</code> <code>nums[i] != nums[i + 1]</code> 均成立</li>\n</ul>\n\n<p>注意,空数组同样认为是美丽数组。</p>\n\n<p>你可以从 <code>nums</code> 中删除任意数量的元素。当你删除一个元素时,被删除元素右侧的所有元素将会向左移动一个单位以填补空缺,而左侧的元素将会保持 <strong>不变</strong> 。</p>\n\n<p>返回使 <code>nums</code> 变为美丽数组所需删除的 <strong>最少</strong> 元素数目<em>。</em></p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n\n<pre><strong>输入:</strong>nums = [1,1,2,3,5]\n<strong>输出:</strong>1\n<strong>解释:</strong>可以删除 <code>nums[0]</code> 或 <code>nums[1]</code> ,这样得到的 <code>nums</code> = [1,2,3,5] 是一个美丽数组。可以证明,要想使 nums 变为美丽数组,至少需要删除 1 个元素。</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre><strong>输入:</strong>nums = [1,1,2,2,3,3]\n<strong>输出:</strong>2\n<strong>解释:</strong>可以删除 <code>nums[0]</code> 和 <code>nums[5]</code> ,这样得到的 nums = [1,2,2,3] 是一个美丽数组。可以证明,要想使 nums 变为美丽数组,至少需要删除 2 个元素。\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>\n\t<li><code>0 &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 11,
"likes": 15,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"13K\", \"totalAcceptedRaw\": 5685, \"totalSubmissionRaw\": 13022, \"acRate\": \"43.7%\"}",
"stats": "{\"totalAccepted\": \"6.6K\", \"totalSubmission\": \"14.5K\", \"totalAcceptedRaw\": 6606, \"totalSubmissionRaw\": 14539, \"acRate\": \"45.4%\"}",
"hints": [
"Delete as many adjacent equal elements as necessary.",
"If the length of nums is odd after the entire process, delete the last element."