mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
194 lines
21 KiB
JSON
194 lines
21 KiB
JSON
|
{
|
|||
|
|
"data": {
|
|||
|
|
"question": {
|
|||
|
|
"questionId": "3360",
|
|||
|
|
"questionFrontendId": "3085",
|
|||
|
|
"boundTopicId": null,
|
|||
|
|
"title": "Minimum Deletions to Make String K-Special",
|
|||
|
|
"titleSlug": "minimum-deletions-to-make-string-k-special",
|
|||
|
|
"content": "<p>You are given a string <code>word</code> and an integer <code>k</code>.</p>\n\n<p>We consider <code>word</code> to be <strong>k-special</strong> if <code>|freq(word[i]) - freq(word[j])| <= k</code> for all indices <code>i</code> and <code>j</code> in the string.</p>\n\n<p>Here, <code>freq(x)</code> denotes the <span data-keyword=\"frequency-letter\">frequency</span> of the character <code>x</code> in <code>word</code>, and <code>|y|</code> denotes the absolute value of <code>y</code>.</p>\n\n<p>Return <em>the <strong>minimum</strong> number of characters you need to delete to make</em> <code>word</code> <strong><em>k-special</em></strong>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<div class=\"example-block\" style=\"border-color: var(--border-tertiary); border-left-width: 2px; color: var(--text-secondary); font-size: .875rem; margin-bottom: 1rem; margin-top: 1rem; overflow: visible; padding-left: 1rem;\">\n<p><strong>Input: </strong><span class=\"example-io\" style=\"font-family: Menlo,sans-serif; font-size: 0.85rem;\">word = "aabcaba", k = 0</span></p>\n\n<p><strong>Output: </strong><span class=\"example-io\" style=\"font-family: Menlo,sans-serif; font-size: 0.85rem;\">3</span></p>\n\n<p><strong>Explanation:</strong> We can make <code>word</code> <code>0</code>-special by deleting <code>2</code> occurrences of <code>"a"</code> and <code>1</code> occurrence of <code>"c"</code>. Therefore, <code>word</code> becomes equal to <code>"baba"</code> where <code>freq('a') == freq('b') == 2</code>.</p>\n</div>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<div class=\"example-block\" style=\"border-color: var(--border-tertiary); border-left-width: 2px; color: var(--text-secondary); font-size: .875rem; margin-bottom: 1rem; margin-top: 1rem; overflow: visible; padding-left: 1rem;\">\n<p><strong>Input: </strong><span class=\"example-io\" style=\"font-family: Menlo,sans-serif; font-size: 0.85rem;\">word = "dabdcbdcdcd", k = 2</span></p>\n\n<p><strong>Output: </strong><span class=\"example-io\" style=\"font-family: Menlo,sans-serif; font-size: 0.85rem;\">2</span></p>\n\n<p><strong>Explanation:</strong> We can make <code>word</code> <code>2</code>-special by deleting <code>1</code> occurrence of <code>"a"</code> and <code>1</code> occurrence of <code>"d"</code>. Therefore, <code>word</code> becomes equal to "bdcbdcdcd" where <code>freq('b') == 2</code>, <code>freq('c') == 3</code>, and <code>freq('d') == 4</code>.</p>\n</div>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<div class=\"example-block\" style=\"border-color: var(--border-tertiary); border-left-width: 2px; color: var(--text-secondary); font-size: .875rem; margin-bottom: 1rem; margin-top: 1rem; overflow: visible; padding-left: 1rem;\">\n<p><strong>Input: </strong><span class=\"example-io\" style=\"font-family: Menlo,sans-serif; font-size: 0.85rem;\">word = "aaabaaa", k = 2</span></p>\n\n<p><strong>Output: </strong><span class=\"example-io\" style=\"font-family: Menlo,sans-serif; font-size: 0.85rem;\">1</span></p>\n\n<p><strong>Explanation:</strong> We can make <code>word</code> <code>2</code>-special by deleting <code>1</code> occurrence of <code>"b"</code>. Therefore, <code>word</code> becomes equal to <code>"aaaaaa"</code> where each letter's frequency is now uniformly <code>6</code>.</p>\n</div>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= word.length <= 10<sup>5</sup></code></li>\n\t<li><code>0 <= k <= 10<sup>5</sup></code></li>\n\t<li><code>word</code> consists only of lowercase English letters.</li>\n</ul>\n",
|
|||
|
|
"translatedTitle": null,
|
|||
|
|
"translatedContent": null,
|
|||
|
|
"isPaidOnly": false,
|
|||
|
|
"difficulty": "Medium",
|
|||
|
|
"likes": 158,
|
|||
|
|
"dislikes": 9,
|
|||
|
|
"isLiked": null,
|
|||
|
|
"similarQuestions": "[{\"title\": \"Minimum Deletions to Make Character Frequencies Unique\", \"titleSlug\": \"minimum-deletions-to-make-character-frequencies-unique\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
|||
|
|
"exampleTestcases": "\"aabcaba\"\n0\n\"dabdcbdcdcd\"\n2\n\"aaabaaa\"\n2",
|
|||
|
|
"categoryTitle": "Algorithms",
|
|||
|
|
"contributors": [],
|
|||
|
|
"topicTags": [
|
|||
|
|
{
|
|||
|
|
"name": "Hash Table",
|
|||
|
|
"slug": "hash-table",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"name": "String",
|
|||
|
|
"slug": "string",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"name": "Greedy",
|
|||
|
|
"slug": "greedy",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"name": "Sorting",
|
|||
|
|
"slug": "sorting",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"name": "Counting",
|
|||
|
|
"slug": "counting",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
}
|
|||
|
|
],
|
|||
|
|
"companyTagStats": null,
|
|||
|
|
"codeSnippets": [
|
|||
|
|
{
|
|||
|
|
"lang": "C++",
|
|||
|
|
"langSlug": "cpp",
|
|||
|
|
"code": "class Solution {\npublic:\n int minimumDeletions(string word, int k) {\n \n }\n};",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Java",
|
|||
|
|
"langSlug": "java",
|
|||
|
|
"code": "class Solution {\n public int minimumDeletions(String word, int k) {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Python",
|
|||
|
|
"langSlug": "python",
|
|||
|
|
"code": "class Solution(object):\n def minimumDeletions(self, word, k):\n \"\"\"\n :type word: str\n :type k: int\n :rtype: int\n \"\"\"\n ",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Python3",
|
|||
|
|
"langSlug": "python3",
|
|||
|
|
"code": "class Solution:\n def minimumDeletions(self, word: str, k: int) -> int:\n ",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "C",
|
|||
|
|
"langSlug": "c",
|
|||
|
|
"code": "int minimumDeletions(char* word, int k) {\n \n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "C#",
|
|||
|
|
"langSlug": "csharp",
|
|||
|
|
"code": "public class Solution {\n public int MinimumDeletions(string word, int k) {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "JavaScript",
|
|||
|
|
"langSlug": "javascript",
|
|||
|
|
"code": "/**\n * @param {string} word\n * @param {number} k\n * @return {number}\n */\nvar minimumDeletions = function(word, k) {\n \n};",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "TypeScript",
|
|||
|
|
"langSlug": "typescript",
|
|||
|
|
"code": "function minimumDeletions(word: string, k: number): number {\n \n};",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "PHP",
|
|||
|
|
"langSlug": "php",
|
|||
|
|
"code": "class Solution {\n\n /**\n * @param String $word\n * @param Integer $k\n * @return Integer\n */\n function minimumDeletions($word, $k) {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Swift",
|
|||
|
|
"langSlug": "swift",
|
|||
|
|
"code": "class Solution {\n func minimumDeletions(_ word: String, _ k: Int) -> Int {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Kotlin",
|
|||
|
|
"langSlug": "kotlin",
|
|||
|
|
"code": "class Solution {\n fun minimumDeletions(word: String, k: Int): Int {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Dart",
|
|||
|
|
"langSlug": "dart",
|
|||
|
|
"code": "class Solution {\n int minimumDeletions(String word, int k) {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Go",
|
|||
|
|
"langSlug": "golang",
|
|||
|
|
"code": "func minimumDeletions(word string, k int) int {\n \n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Ruby",
|
|||
|
|
"langSlug": "ruby",
|
|||
|
|
"code": "# @param {String} word\n# @param {Integer} k\n# @return {Integer}\ndef minimum_deletions(word, k)\n \nend",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Scala",
|
|||
|
|
"langSlug": "scala",
|
|||
|
|
"code": "object Solution {\n def minimumDeletions(word: String, k: Int): Int = {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Rust",
|
|||
|
|
"langSlug": "rust",
|
|||
|
|
"code": "impl Solution {\n pub fn minimum_deletions(word: String, k: i32) -> i32 {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Racket",
|
|||
|
|
"langSlug": "racket",
|
|||
|
|
"code": "(define/contract (minimum-deletions word k)\n (-> string? exact-integer? exact-integer?)\n )",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Erlang",
|
|||
|
|
"langSlug": "erlang",
|
|||
|
|
"code": "-spec minimum_deletions(Word :: unicode:unicode_binary(), K :: integer()) -> integer().\nminimum_deletions(Word, K) ->\n .",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Elixir",
|
|||
|
|
"langSlug": "elixir",
|
|||
|
|
"code": "defmodule Solution do\n @spec minimum_deletions(word :: String.t, k :: integer) :: integer\n def minimum_deletions(word, k) do\n \n end\nend",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
}
|
|||
|
|
],
|
|||
|
|
"stats": "{\"totalAccepted\": \"17.1K\", \"totalSubmission\": \"39.1K\", \"totalAcceptedRaw\": 17093, \"totalSubmissionRaw\": 39059, \"acRate\": \"43.8%\"}",
|
|||
|
|
"hints": [
|
|||
|
|
"Count the frequency of each letter.",
|
|||
|
|
"Suppose we select several characters as the final answer, and let <code>x</code> be the character with the smallest frequency in the answer. It can be shown that out of the selected characters, the optimal solution will never delete an occurrence of character <code>x</code> to obtain the answer.",
|
|||
|
|
"We will fix a character <code>c</code> and assume that it will be the character with the smallest frequency in the answer. Suppose its frequency is <code>x</code>.",
|
|||
|
|
"Then, for every other character, we will count the number of occurrences that will be deleted. Suppose that the current character has <code>y</code> occurrences. <ol> <li>If y < x, we need to delete all of them.</li> <li> if y > x + k, we should delete y - x - k of such character.</li> <li> Otherwise we don’t need to delete it.</li></ol>"
|
|||
|
|
],
|
|||
|
|
"solution": null,
|
|||
|
|
"status": null,
|
|||
|
|
"sampleTestCase": "\"aabcaba\"\n0",
|
|||
|
|
"metaData": "{\n \"name\": \"minimumDeletions\",\n \"params\": [\n {\n \"name\": \"word\",\n \"type\": \"string\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
|
|||
|
|
"judgerAvailable": true,
|
|||
|
|
"judgeType": "large",
|
|||
|
|
"mysqlSchemas": [],
|
|||
|
|
"enableRunCode": true,
|
|||
|
|
"enableTestMode": false,
|
|||
|
|
"enableDebugger": true,
|
|||
|
|
"envInfo": "{\"cpp\": [\"C++\", \"<p>Compiled with <code> clang 17 </code> using the latest C++ 20 standard, and <code>libstdc++</code> provided by GCC 11.</p>\\r\\n\\r\\n<p>Your code is compiled with level two optimization (<code>-O2</code>). <a href=\\\"https://github.com/google/sanitizers/wiki/AddressSanitizer\\\" target=\\\"_blank\\\">AddressSanitizer</a> is also enabled to help detect out-of-bounds and use-after-free bugs.</p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\"], \"java\": [\"Java\", \"<p><code>OpenJDK 21</code>. Using compile arguments: <code>--enable-preview --release 21</code></p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\\r\\n<p>Includes <code>Pair</code> class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.</p>\"], \"python\": [\"Python\", \"<p><code>Python 2.7.12</code>.</p>\\r\\n\\r\\n<p>Most libraries are already imported automatically for your convenience, such as <a href=\\\"https://docs.python.org/2/library/array.html\\\" target=\\\"_blank\\\">array</a>, <a href=\\\"https://docs.python.org/2/library/bisect.html\\\" target=\\\"_blank\\\">bisect</a>, <a href=\\\"https://docs.python.org/2/library/collections.html\\\" target=\\\"_blank\\\">collections</a>. If you need more libraries, you can import it yourself.</p>\\r\\n\\r\\n<p>For Map/TreeMap data structure, you may use <a href=\\\"http://www.grantjenks.com/docs/sortedcontainers/\\\" target=\\\"_blank\\\">sortedcontainers</a> library.</p>\\r\\n\\r\\n<p>Note that Python 2.7 <a href=\\\"https://www.python.org/dev/peps/pep-0373/\\\" target=\\\"_blank\\\">will not be maintained past 2020</a>. For the latest Python, please choose Python3 instead.</p>\"], \"c\": [\"C\", \"<p>Compiled with <code>gcc 11</code> using the gnu11 standard.</p>\\r\\n\\r\\n<p>Your code is compiled with level one optimization (<code>-O2</code>). <a href=\\\"https://github.com/google/sanitizers/wiki/AddressSanitizer\\\" target=\\\"_blank\\\">AddressSanitizer</a> is also enabled to help detect out-of-bounds and use-after-free bugs.</p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\\r\\n\\r\\n<p>For hash table operations, you may use <a href=\\\"https://troydhanson.github.io/uthash/\\\" target=\\\"_blank\\\">uthash</a>. \\\"uthash.h\\\" is included by default. Below are some examples:</p>\\r\\n\\r\\n<p><b>1. Adding an item to a hash.</b>\\r\\n<pre>\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n</pre>\\r\\n</p>\\r\\n\\r\\n<p><b>2. Looking up an item in a hash:</b>\\r\\n<pre>\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n</pre>\\r\\n</p>\\r\\n\\r\\n<p><b>3. Deleting an item in a hash:</b>\\r\\n<pre>\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n</pre>\\r\\n</p>\"], \"csharp\": [\"C#\", \"<p><a href=\\\"https://learn.microsoft.com/en-us/dotnet/csharp/whats-new/csharp-12\\\" target=\\\"_blank\\\">C# 12</a> with .NET 8 runtime</p>\"], \"javascript\": [\"JavaScript\", \"<p><code>Node.js 20.10.0</code>.</p>\\r\\n\\r\\n<p>Your code is run with <code>--harmony</code> flag, enabling <a href=\\\"http://node.green/\\\" target=\\\"_blank\\\">new ES6 features</a>.</p>\\r\\n\\r\\n<p><a href=\\\"https://lodash.com\\\" target=\\\"_blank\\\">lodash.js</a> library is included by default.</p>\\r\\n\\r\\n<p>For Priority Queue / Queue data structures, you may use 5.4.0 version of <a href=\\\"https://github.com/datastructures-js/priority-queue/blob/v5/README.md\\\" target=\\\"_blank\\\">datastructures-js/priority-queue</a> and 4.2.3 version of <a href=\\\
|
|||
|
|
"libraryUrl": null,
|
|||
|
|
"adminUrl": null,
|
|||
|
|
"challengeQuestion": null,
|
|||
|
|
"__typename": "QuestionNode"
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|