mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
168 lines
18 KiB
JSON
168 lines
18 KiB
JSON
|
{
|
|||
|
|
"data": {
|
|||
|
|
"question": {
|
|||
|
|
"questionId": "1834",
|
|||
|
|
"questionFrontendId": "1733",
|
|||
|
|
"boundTopicId": null,
|
|||
|
|
"title": "Minimum Number of People to Teach",
|
|||
|
|
"titleSlug": "minimum-number-of-people-to-teach",
|
|||
|
|
"content": "<p>On a social network consisting of <code>m</code> users and some friendships between users, two users can communicate with each other if they know a common language.</p>\n\n<p>You are given an integer <code>n</code>, an array <code>languages</code>, and an array <code>friendships</code> where:</p>\n\n<ul>\n\t<li>There are <code>n</code> languages numbered <code>1</code> through <code>n</code>,</li>\n\t<li><code>languages[i]</code> is the set of languages the <code>i<sup>th</sup></code> user knows, and</li>\n\t<li><code>friendships[i] = [u<sub>i</sub>, v<sub>i</sub>]</code> denotes a friendship between the users <code>u<sup></sup><sub>i</sub></code> and <code>v<sub>i</sub></code>.</li>\n</ul>\n\n<p>You can choose <strong>one</strong> language and teach it to some users so that all friends can communicate with each other. Return <i data-stringify-type=\"italic\">the</i> <i><strong>minimum</strong> </i><i data-stringify-type=\"italic\">number of users you need to teach.</i></p>\nNote that friendships are not transitive, meaning if <code>x</code> is a friend of <code>y</code> and <code>y</code> is a friend of <code>z</code>, this doesn't guarantee that <code>x</code> is a friend of <code>z</code>.\n<p> </p>\n<p><strong>Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 2, languages = [[1],[2],[1,2]], friendships = [[1,2],[1,3],[2,3]]\n<strong>Output:</strong> 1\n<strong>Explanation:</strong> You can either teach user 1 the second language or user 2 the first language.\n</pre>\n\n<p><strong>Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 3, languages = [[2],[1,3],[1,2],[3]], friendships = [[1,4],[1,2],[3,4],[2,3]]\n<strong>Output:</strong> 2\n<strong>Explanation:</strong> Teach the third language to users 1 and 3, yielding two users to teach.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>2 <= n <= 500</code></li>\n\t<li><code>languages.length == m</code></li>\n\t<li><code>1 <= m <= 500</code></li>\n\t<li><code>1 <= languages[i].length <= n</code></li>\n\t<li><code>1 <= languages[i][j] <= n</code></li>\n\t<li><code>1 <= u<sub>i</sub> < v<sub>i</sub> <= languages.length</code></li>\n\t<li><code>1 <= friendships.length <= 500</code></li>\n\t<li>All tuples <code>(u<sub>i, </sub>v<sub>i</sub>)</code> are unique</li>\n\t<li><code>languages[i]</code> contains only unique values</li>\n</ul>\n",
|
|||
|
|
"translatedTitle": null,
|
|||
|
|
"translatedContent": null,
|
|||
|
|
"isPaidOnly": false,
|
|||
|
|
"difficulty": "Medium",
|
|||
|
|
"likes": 133,
|
|||
|
|
"dislikes": 299,
|
|||
|
|
"isLiked": null,
|
|||
|
|
"similarQuestions": "[]",
|
|||
|
|
"exampleTestcases": "2\n[[1],[2],[1,2]]\n[[1,2],[1,3],[2,3]]\n3\n[[2],[1,3],[1,2],[3]]\n[[1,4],[1,2],[3,4],[2,3]]",
|
|||
|
|
"categoryTitle": "Algorithms",
|
|||
|
|
"contributors": [],
|
|||
|
|
"topicTags": [
|
|||
|
|
{
|
|||
|
|
"name": "Array",
|
|||
|
|
"slug": "array",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"name": "Greedy",
|
|||
|
|
"slug": "greedy",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
}
|
|||
|
|
],
|
|||
|
|
"companyTagStats": null,
|
|||
|
|
"codeSnippets": [
|
|||
|
|
{
|
|||
|
|
"lang": "C++",
|
|||
|
|
"langSlug": "cpp",
|
|||
|
|
"code": "class Solution {\npublic:\n int minimumTeachings(int n, vector<vector<int>>& languages, vector<vector<int>>& friendships) {\n \n }\n};",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Java",
|
|||
|
|
"langSlug": "java",
|
|||
|
|
"code": "class Solution {\n public int minimumTeachings(int n, int[][] languages, int[][] friendships) {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Python",
|
|||
|
|
"langSlug": "python",
|
|||
|
|
"code": "class Solution(object):\n def minimumTeachings(self, n, languages, friendships):\n \"\"\"\n :type n: int\n :type languages: List[List[int]]\n :type friendships: List[List[int]]\n :rtype: int\n \"\"\"\n ",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Python3",
|
|||
|
|
"langSlug": "python3",
|
|||
|
|
"code": "class Solution:\n def minimumTeachings(self, n: int, languages: List[List[int]], friendships: List[List[int]]) -> int:\n ",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "C",
|
|||
|
|
"langSlug": "c",
|
|||
|
|
"code": "\n\nint minimumTeachings(int n, int** languages, int languagesSize, int* languagesColSize, int** friendships, int friendshipsSize, int* friendshipsColSize){\n\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "C#",
|
|||
|
|
"langSlug": "csharp",
|
|||
|
|
"code": "public class Solution {\n public int MinimumTeachings(int n, int[][] languages, int[][] friendships) {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "JavaScript",
|
|||
|
|
"langSlug": "javascript",
|
|||
|
|
"code": "/**\n * @param {number} n\n * @param {number[][]} languages\n * @param {number[][]} friendships\n * @return {number}\n */\nvar minimumTeachings = function(n, languages, friendships) {\n \n};",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Ruby",
|
|||
|
|
"langSlug": "ruby",
|
|||
|
|
"code": "# @param {Integer} n\n# @param {Integer[][]} languages\n# @param {Integer[][]} friendships\n# @return {Integer}\ndef minimum_teachings(n, languages, friendships)\n \nend",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Swift",
|
|||
|
|
"langSlug": "swift",
|
|||
|
|
"code": "class Solution {\n func minimumTeachings(_ n: Int, _ languages: [[Int]], _ friendships: [[Int]]) -> Int {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Go",
|
|||
|
|
"langSlug": "golang",
|
|||
|
|
"code": "func minimumTeachings(n int, languages [][]int, friendships [][]int) int {\n \n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Scala",
|
|||
|
|
"langSlug": "scala",
|
|||
|
|
"code": "object Solution {\n def minimumTeachings(n: Int, languages: Array[Array[Int]], friendships: Array[Array[Int]]): Int = {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Kotlin",
|
|||
|
|
"langSlug": "kotlin",
|
|||
|
|
"code": "class Solution {\n fun minimumTeachings(n: Int, languages: Array<IntArray>, friendships: Array<IntArray>): Int {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Rust",
|
|||
|
|
"langSlug": "rust",
|
|||
|
|
"code": "impl Solution {\n pub fn minimum_teachings(n: i32, languages: Vec<Vec<i32>>, friendships: Vec<Vec<i32>>) -> i32 {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "PHP",
|
|||
|
|
"langSlug": "php",
|
|||
|
|
"code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $languages\n * @param Integer[][] $friendships\n * @return Integer\n */\n function minimumTeachings($n, $languages, $friendships) {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "TypeScript",
|
|||
|
|
"langSlug": "typescript",
|
|||
|
|
"code": "function minimumTeachings(n: number, languages: number[][], friendships: number[][]): number {\n\n};",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Racket",
|
|||
|
|
"langSlug": "racket",
|
|||
|
|
"code": "(define/contract (minimum-teachings n languages friendships)\n (-> exact-integer? (listof (listof exact-integer?)) (listof (listof exact-integer?)) exact-integer?)\n\n )",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Erlang",
|
|||
|
|
"langSlug": "erlang",
|
|||
|
|
"code": "-spec minimum_teachings(N :: integer(), Languages :: [[integer()]], Friendships :: [[integer()]]) -> integer().\nminimum_teachings(N, Languages, Friendships) ->\n .",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Elixir",
|
|||
|
|
"langSlug": "elixir",
|
|||
|
|
"code": "defmodule Solution do\n @spec minimum_teachings(n :: integer, languages :: [[integer]], friendships :: [[integer]]) :: integer\n def minimum_teachings(n, languages, friendships) do\n\n end\nend",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
}
|
|||
|
|
],
|
|||
|
|
"stats": "{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"14.6K\", \"totalAcceptedRaw\": 5935, \"totalSubmissionRaw\": 14602, \"acRate\": \"40.6%\"}",
|
|||
|
|
"hints": [
|
|||
|
|
"You can just use brute force and find out for each language the number of users you need to teach",
|
|||
|
|
"Note that a user can appear in multiple friendships but you need to teach that user only once"
|
|||
|
|
],
|
|||
|
|
"solution": null,
|
|||
|
|
"status": null,
|
|||
|
|
"sampleTestCase": "2\n[[1],[2],[1,2]]\n[[1,2],[1,3],[2,3]]",
|
|||
|
|
"metaData": "{\n \"name\": \"minimumTeachings\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"languages\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"friendships\"\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 11 </code> using the latest C++ 17 standard.</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 17 </code>. Java 8 features such as lambda expressions and stream API can be used. </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 8.2</code> using the gnu99 standard.</p>\\r\\n\\r\\n<p>Your code is compiled with level one optimization (<code>-O1</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://docs.microsoft.com/en-us/dotnet/csharp/whats-new/csharp-9\\\" target=\\\"_blank\\\">C# 10 with .NET 6 runtime</a></p>\\r\\n\\r\\n<p>Your code is compiled with debug flag enabled (<code>/debug</code>).</p>\"], \"javascript\": [\"JavaScript\", \"<p><code>Node.js 16.13.2</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 <a href=\\\"https://github.com/datastructures-js/priority-queue\\\" target=\\\"_blank\\\">datastructures-js/priority-queue</a> and <a href=\\\"https:
|
|||
|
|
"libraryUrl": null,
|
|||
|
|
"adminUrl": null,
|
|||
|
|
"challengeQuestion": null,
|
|||
|
|
"__typename": "QuestionNode"
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|